( en | de | ru )

 

Disambiguation of "Ciampi, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Online/Offline OR Composition of Sigma Protocols.

, , , , and . EUROCRYPT (2), volume 9666 of Lecture Notes in Computer Science, page 63-92. 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.

Michele Galletti

Michele Ocken

Michele Ferrari

Hannelore Michele

Michele Cagnoli

 

Other publications of authors with the same name

Efficient NIZK Arguments with Straight-Line Simulation and Extraction., and . CANS, volume 13641 of Lecture Notes in Computer Science, page 3-22. Springer, (2022)Black-Box (and Fast) Non-malleable Zero Knowledge., , , , and . CRYPTO (9), volume 14928 of Lecture Notes in Computer Science, page 458-490. Springer, (2024)Four-Round Secure Multiparty Computation from General Assumptions., and . IACR Cryptology ePrint Archive, (2019)Agile Cryptography: A Universally Composable Approach., , and . TCC (4), volume 14372 of Lecture Notes in Computer Science, page 480-509. Springer, (2023)Four-Round Black-Box Non-malleable Schemes from One-Way Permutations., , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 300-329. Springer, (2022)Multi-Theorem Fiat-Shamir Transform from Correlation-Intractable Hash Functions., and . ACNS, volume 13906 of Lecture Notes in Computer Science, page 555-581. Springer, (2023)A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles., , , and . TCC (A2), volume 9563 of Lecture Notes in Computer Science, page 83-111. Springer, (2016)Universal Composable Transaction Serialization with Order Fairness., , and . IACR Cryptol. ePrint Arch., (2024)Combining Private Set-Intersection with Secure Two-Party Computation., and . SCN, volume 11035 of Lecture Notes in Computer Science, page 464-482. Springer, (2018)Round Optimal Secure Multiparty Computation from Minimal Assumptions., , , , and . TCC (2), volume 12551 of Lecture Notes in Computer Science, page 291-319. Springer, (2020)