PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Lyubashevsky, Vadim"

Author of the publication

copydeleteadd this publication to your clipboard
Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures.

, , , , and . ASIACRYPT (1), volume 8873 of Lecture Notes in Computer Science, page 551-572. Springer, (2014)

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.

Vadim Vorobev University of Stuttgart

 

Other publications of authors with the same name

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing., , , and . IACR Cryptology ePrint Archive, (2018)Asymptotically Efficient Lattice-Based Digital Signatures., and . TCC, volume 4948 of Lecture Notes in Computer Science, page 37-54. Springer, (2008)Generalized Compact Knapsacks Are Collision Resistant., and . ICALP (2), volume 4052 of Lecture Notes in Computer Science, page 144-155. Springer, (2006)On Ideal Lattices and Learning with Errors over Rings., , and . EUROCRYPT, volume 6110 of Lecture Notes in Computer Science, page 1-23. Springer, (2010)Lattice Signatures without Trapdoors.. EUROCRYPT, volume 7237 of Lecture Notes in Computer Science, page 738-755. Springer, (2012)Tightly-Secure Signatures from Lossy Identification Schemes., , , and . EUROCRYPT, volume 7237 of Lecture Notes in Computer Science, page 572-590. Springer, (2012)Amortization with Fewer Equations for Proving Knowledge of Small Secrets., and . CRYPTO (3), volume 10403 of Lecture Notes in Computer Science, page 365-394. Springer, (2017)Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits., , , , , and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 669-699. Springer, (2018)The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem.. APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, page 378-389. Springer, (2005)Simple Lattice Trapdoor Sampling from a Broad Class of Distributions., and . IACR Cryptology ePrint Archive, (2014)