๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

Category Labs
@category_xyz
We build high-performance decentralized systems.
๊ฐ€์ž… December 2024
21 ํŒ”๋กœ์ž‰ ์ค‘    11K ํŒฌ
Check out Tree-BTE ๐ŸŒณ, our new tree-based approach to designing batched threshold encryption (BTE), the cryptographic tool for encrypted mempools. Tree-BTE can be instantiated with different cryptographic hardness assumptions to yield different properties. For example, with a lattice-based hardness assumption, we get a post-quantum secure BTE scheme with >100x faster decryption than prior lattice-based schemes. Instantiations based on other assumptions (such as DDH, DCR, LWR) are also possible. Check out our paper on eprint.
๋” ๋ณด๊ธฐ