Author of the publication

Nearly Optimal Verifiable Data Streaming.

, , , , , and . Public Key Cryptography (1), volume 9614 of Lecture Notes in Computer Science, page 417-445. 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

Burning Zerocoins for Fun and for Profit: A Cryptographic Denial-of-Spending Attack on the Zerocoin Protocol., , , and . IACR Cryptology ePrint Archive, (2018)Nearly Optimal Verifiable Data Streaming (Full Version)., , , , , and . IACR Cryptology ePrint Archive, (2015)Efficient Sanitizable Signatures without Random Oracles., , , and . IACR Cryptology ePrint Archive, (2017)Security of Blind Signatures Revisited., and . IACR Cryptology ePrint Archive, (2011)Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations., and . TCC, volume 7194 of Lecture Notes in Computer Science, page 636-653. Springer, (2012)On the complexity of blind signatures.. Darmstadt University of Technology, (2010)Functional Credentials., , , , , and . PoPETs, 2018 (2): 64-84 (2018)On Tight Security Proofs for Schnorr Signatures., , and . ASIACRYPT (1), volume 8873 of Lecture Notes in Computer Science, page 512-531. Springer, (2014)Homomorphic Secret Sharing for Low Degree Polynomials., , and . ASIACRYPT (3), volume 11274 of Lecture Notes in Computer Science, page 279-309. Springer, (2018)Security of Sanitizable Signatures Revisited., , , , , , , and . Public Key Cryptography, volume 5443 of Lecture Notes in Computer Science, page 317-336. Springer, (2009)