From post

Laconic Branching Programs from the Diffie-Hellman Assumption.

, , , и . Public Key Cryptography (3), том 14603 из Lecture Notes in Computer Science, стр. 323-355. Springer, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Registration-Based Encryption from Standard Assumptions., , , , и . IACR Cryptol. ePrint Arch., (2018)Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More., , и . IACR Cryptol. ePrint Arch., (2019)Tight Verifiable Delay Functions., , , и . IACR Cryptol. ePrint Arch., (2019)Hardness Preserving Constructions of Pseudorandom Functions, Revisited., и . IACR Cryptol. ePrint Arch., (2012)Identity-based Encryption from the Diffie-Hellman Assumption., и . J. ACM, 68 (3): 14:1-14:46 (2021)Incremental Program Obfuscation., и . CRYPTO (2), том 10402 из Lecture Notes in Computer Science, стр. 193-223. Springer, (2017)TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption., , и . CRYPTO (3), том 9816 из Lecture Notes in Computer Science, стр. 563-592. Springer, (2016)Trapdoor Hash Functions and Their Applications., , , , , и . CRYPTO (3), том 11694 из Lecture Notes in Computer Science, стр. 3-32. Springer, (2019)Two-Round Multiparty Secure Computation Minimizing Public Key Operations., , и . CRYPTO (3), том 10993 из Lecture Notes in Computer Science, стр. 273-301. Springer, (2018)Laconic Private Set Intersection and Applications., , , , , и . TCC (3), том 13044 из Lecture Notes in Computer Science, стр. 94-125. Springer, (2021)