( en | de | ru )

 

Disambiguation of "Lombardi, Alex"

Author of the publication

copydeleteadd this publication to your clipboard
Statistical ZAPR Arguments from Bilinear Maps.

, , and . EUROCRYPT (3), volume 12107 of Lecture Notes in Computer Science, page 620-641. Springer, (2020)

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.

Michele Lombardi

Pio Lombardi

Alfonso Lombardi

Angelo Lombardi

Ilde Mancini Lombardi

 

Other publications of authors with the same name

SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption., , and . EUROCRYPT (2), volume 14005 of Lecture Notes in Computer Science, page 470-498. Springer, (2023)Correlation-Intractable Hash Functions via Shift-Hiding., and . ITCS, volume 215 of LIPIcs, page 102:1-102:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fiat-Shamir From Simpler Assumptions., , , , , and . IACR Cryptol. ePrint Arch., (2018)Boosting Batch Arguments and RAM Delegation., , , and . IACR Cryptol. ePrint Arch., (2022)PPAD is as Hard as LWE and Iterated Squaring., , , , , , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 593-622. Springer, (2022)Quantum Advantage from Any Non-local Game., , , and . STOC, page 1617-1628. ACM, (2023)Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)., , and . STOC, page 750-760. ACM, (2021)Does Fiat-Shamir Require a Cryptographic Hash Function?, , , and . CRYPTO (4), volume 12828 of Lecture Notes in Computer Science, page 334-363. Springer, (2021)Statistical ZAPR Arguments from Bilinear Maps., , and . EUROCRYPT (3), volume 12107 of Lecture Notes in Computer Science, page 620-641. Springer, (2020)Quantum Advantage from Any Non-Local Game., , , and . IACR Cryptol. ePrint Arch., (2022)