Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Foundations of Fully Dynamic Group Signatures.

J. Bootle, A. Cerulli, P. Chaidos, E. Ghadafi, and J. Groth. ACNS, volume 9696 of Lecture Notes in Computer Science, page 117-136. 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.

Jonathan Böhm University of Stuttgart

Jonathan Eck University of Stuttgart

Jonathan Villing University of Stuttgart

Jonathan Stober University of Stuttgart

Jonathan Skalden University of Stuttgart

Other publications of authors with the same name

Bulletproofs: Short Proofs for Confidential Transactions and More.B. Bünz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell. IACR Cryptology ePrint Archive, (2017)Short Accountable Ring Signatures Based on DDH.J. Bootle, A. Cerulli, P. Chaidos, E. Ghadafi, J. Groth, and C. Petit. ESORICS (1), volume 9326 of Lecture Notes in Computer Science, page 243-265. Springer, (2015)Foundations of Fully Dynamic Group Signatures.J. Bootle, A. Cerulli, P. Chaidos, E. Ghadafi, and J. Groth. ACNS, volume 9696 of Lecture Notes in Computer Science, page 117-136. Springer, (2016)Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs.J. Bootle, V. Lyubashevsky, and G. Seiler. CRYPTO (1), volume 11692 of Lecture Notes in Computer Science, page 176-202. Springer, (2019)Cryptanalysis of Compact-LWE.J. Bootle, and M. Tibouchi. IACR Cryptology ePrint Archive, (2017)Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.J. Bootle, A. Cerulli, P. Chaidos, J. Groth, and C. Petit. EUROCRYPT (2), volume 9666 of Lecture Notes in Computer Science, page 327-357. Springer, (2016)Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials.J. Bootle, and J. Groth. Public Key Cryptography (2), volume 10770 of Lecture Notes in Computer Science, page 561-588. Springer, (2018)Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.J. Bootle, A. Cerulli, J. Groth, S. Jakobsen, and M. Maller. ASIACRYPT (1), volume 11272 of Lecture Notes in Computer Science, page 595-626. Springer, (2018)LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS.J. Bootle, C. Delaplace, T. Espitau, P. Fouque, and M. Tibouchi. ASIACRYPT (1), volume 11272 of Lecture Notes in Computer Science, page 494-524. Springer, (2018)Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.J. Bootle, A. Cerulli, E. Ghadafi, J. Groth, M. Hajiabadi, and S. Jakobsen. ASIACRYPT (3), volume 10626 of Lecture Notes in Computer Science, page 336-365. Springer, (2017)