( en | de | ru )

 

Disambiguation of "Ciampi, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Round-Optimal and Communication-Efficient Multiparty Computation.

, , , and . EUROCRYPT (1), volume 13275 of Lecture Notes in Computer Science, page 65-95. Springer, (2022)

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.

Michèle Mattusch

Michele Cagnoli

Michele Ocken

Michele Galletti

Michele Ferrari

 

Other publications of authors with the same name

FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker., , , , and . IACR Cryptol. ePrint Arch., (2021)Four-Round Secure Multiparty Computation from General Assumptions., and . IACR Cryptology ePrint Archive, (2019)Multi-Client Functional Encryption for Separable Functions., , and . IACR Cryptology ePrint Archive, (2020)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)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)Combining Private Set-Intersection with Secure Two-Party Computation., and . SCN, volume 11035 of Lecture Notes in Computer Science, page 464-482. Springer, (2018)Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations., , and . IACR Cryptol. ePrint Arch., (2022)Round Optimal Secure Multiparty Computation from Minimal Assumptions., , , , and . TCC (2), volume 12551 of Lecture Notes in Computer Science, page 291-319. Springer, (2020)