Author of the publication

Efficient Sanitizable Signatures Without Random Oracles.

, , , and . ESORICS (1), volume 9878 of Lecture Notes in Computer Science, page 363-380. Springer, (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract)., , and . CRYPTO (2), volume 14082 of Lecture Notes in Computer Science, page 72-105. Springer, (2023)Trapdoors for Ideal Lattices with Applications., , and . Inscrypt, volume 8957 of Lecture Notes in Computer Science, page 239-256. Springer, (2014)Optimal Succinct Arguments via Hidden Order Groups., and . IACR Cryptology ePrint Archive, (2018)Foundations of Ring Sampling., , , , and . Proc. Priv. Enhancing Technol., 2021 (3): 265-288 (2021)Another Look at Anonymous Communication - Security and Modular Constructions., , , and . Mycrypt, volume 10311 of Lecture Notes in Computer Science, page 56-82. Springer, (2016)Structured Encryption with Non-interactive Updates and Parallel Traversal., and . ICDCS, page 776-777. IEEE Computer Society, (2015)Polynomial-Time Construction of Two-Channel Prefix-Free Codes with Given Codeword Lengths., , , , and . ITW, page 1-6. IEEE, (2021)Decision Procedure for the Existence of Two-Channel Prefix-Free Codes., , , , and . ISIT, page 1522-1526. IEEE, (2019)Cryptography for Parallel RAM from Indistinguishability Obfuscation., , , , , and . ITCS, page 179-190. ACM, (2016)Chainable Functional Commitments for Unbounded-Depth Circuits., , , and . TCC (3), volume 14371 of Lecture Notes in Computer Science, page 363-393. Springer, (2023)