Author of the publication

Efficient Invisible and Unlinkable Sanitizable Signatures.

, , , , , and . Public Key Cryptography (1), volume 11442 of Lecture Notes in Computer Science, page 159-189. Springer, (2019)

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

Computation-Trace Indistinguishability Obfuscation and its Applications., , , , , and . IACR Cryptology ePrint Archive, (2015)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)Functional Commitments for Circuits from Falsifiable Assumptions., , , and . IACR Cryptol. ePrint Arch., (2022)Omniring: Scaling Up Private Payments Without Trusted Setup - Formal Foundations and Constructions of Ring Confidential Transactions with Log-size Proofs., , , , , and . IACR Cryptol. ePrint Arch., (2019)Trapdoors for Ideal Lattices with Applications., , and . Inscrypt, volume 8957 of Lecture Notes in Computer Science, page 239-256. Springer, (2014)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)Searchable Encryption over Feature-Rich Data., , , , , and . IEEE Trans. Dependable Secur. Comput., 15 (3): 496-510 (2018)Cryptography for Parallel RAM from Indistinguishability Obfuscation., , , , , and . ITCS, page 179-190. ACM, (2016)Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes., , , and . ISIT, page 1-6. IEEE, (2022)