default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Ciampi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Michele Ciampi
, Aggelos Kiayias, Yu Shen:
Universal Composable Transaction Serialization with Order Fairness. CRYPTO (2) 2024: 147-180- [c27]Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti:
Black-Box (and Fast) Non-malleable Zero Knowledge. CRYPTO (9) 2024: 458-490 - [i29]Michele Ciampi, Aggelos Kiayias, Yu Shen:
Universal Composable Transaction Serialization with Order Fairness. IACR Cryptol. ePrint Arch. 2024: 1296 (2024) - 2023
- [j1]John Andrews, Michele Ciampi, Vassilis Zikas:
Etherless Ethereum tokens: Simulating native tokens in Ethereum. J. Comput. Syst. Sci. 135: 55-72 (2023) - [c26]Michele Ciampi, Yu Xia:
Multi-Theorem Fiat-Shamir Transform from Correlation-Intractable Hash Functions. ACNS 2023: 555-581 - [c25]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. CRYPTO (1) 2023: 459-488 - [c24]Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov:
Broadcast-Optimal Four-Round MPC in the Plain Model. TCC (2) 2023: 3-32 - [c23]Christian Badertscher, Michele Ciampi, Aggelos Kiayias:
Agile Cryptography: A Universally Composable Approach. TCC (4) 2023: 480-509 - [i28]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. IACR Cryptol. ePrint Arch. 2023: 1512 (2023) - [i27]Michele Ciampi, Yu Xia:
Multi-Theorem Fiat-Shamir Transform from Correlation-Intractable Hash Functions. IACR Cryptol. ePrint Arch. 2023: 1677 (2023) - [i26]Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov:
Broadcast-Optimal Four-Round MPC in the Plain Model. IACR Cryptol. ePrint Arch. 2023: 1739 (2023) - [i25]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions. IACR Cryptol. ePrint Arch. 2023: 1742 (2023) - 2022
- [c22]Michele Ciampi, Ivan Visconti:
Efficient NIZK Arguments with Straight-Line Simulation and Extraction. CANS 2022: 3-22 - [c21]John Andrews, Michele Ciampi, Vassilis Zikas:
Etherless Ethereum Tokens: Simulating Native Tokens in Ethereum. CSCML 2022: 388-407 - [c20]Michele Ciampi, Muhammad Ishaq, Malik Magdon-Ismail, Rafail Ostrovsky, Vassilis Zikas:
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker. CSCML 2022: 428-446 - [c19]Michele Ciampi, Yun Lu, Vassilis Zikas:
Collusion-Preserving Computation without a Mediator. CSF 2022: 211-226 - [c18]Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas:
Round-Optimal and Communication-Efficient Multiparty Computation. EUROCRYPT (1) 2022: 65-95 - [c17]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Multi-party Computation with Identifiable Abort. EUROCRYPT (1) 2022: 335-364 - [c16]Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi:
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. TCC (2) 2022: 300-329 - [i24]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Multi-Party Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2022: 645 (2022) - [i23]Christian Badertscher, Michele Ciampi, Aggelos Kiayias:
Agile Cryptography: A Composable Approach. IACR Cryptol. ePrint Arch. 2022: 1367 (2022) - [i22]Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi:
Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations. IACR Cryptol. ePrint Arch. 2022: 1543 (2022) - 2021
- [c15]Michele Ciampi, Vipul Goyal, Rafail Ostrovsky:
Threshold Garbled Circuits and Ad Hoc Secure Computation. EUROCRYPT (3) 2021: 64-93 - [c14]Michele Ciampi, Luisa Siniscalchi, Hendrik Waldner:
Multi-Client Functional Encryption for Separable Functions. Public Key Cryptography (1) 2021: 724-753 - [c13]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. TCC (2) 2021: 518-549 - [i21]Michele Ciampi, Vipul Goyal, Rafail Ostrovsky:
Threshold Garbled Circuits and Ad Hoc Secure Computation. IACR Cryptol. ePrint Arch. 2021: 308 (2021) - [i20]Michele Ciampi, Muhammad Ishaq, Malik Magdon-Ismail, Rafail Ostrovsky, Vassilis Zikas:
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker. IACR Cryptol. ePrint Arch. 2021: 609 (2021) - [i19]John Andrews, Michele Ciampi, Vassilis Zikas:
Etherless Ethereum Tokens: Simulating Native Tokens in Ethereum. IACR Cryptol. ePrint Arch. 2021: 766 (2021) - [i18]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. IACR Cryptol. ePrint Arch. 2021: 1433 (2021) - 2020
- [c12]Aydin Abadi, Michele Ciampi, Aggelos Kiayias, Vassilis Zikas:
Timed Signatures and Zero-Knowledge Proofs - Timestamping in the Blockchain Era -. ACNS (1) 2020: 335-354 - [c11]Michele Ciampi, Nikos Karayannidis, Aggelos Kiayias, Dionysis Zindros:
Updatable Blockchains. ESORICS (2) 2020: 590-609 - [c10]Michele Ciampi, Roberto Parisella, Daniele Venturi:
On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs. SCN 2020: 670-690 - [c9]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Round Optimal Secure Multiparty Computation from Minimal Assumptions. TCC (2) 2020: 291-319 - [i17]Michele Ciampi, Luisa Siniscalchi, Hendrik Waldner:
Multi-Client Functional Encryption for Separable Functions. IACR Cryptol. ePrint Arch. 2020: 219 (2020) - [i16]Michele Ciampi, Yun Lu, Vassilis Zikas:
Collusion-Preserving Computation without a Mediator. IACR Cryptol. ePrint Arch. 2020: 497 (2020) - [i15]Michele Ciampi, Roberto Parisella, Daniele Venturi:
On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs. IACR Cryptol. ePrint Arch. 2020: 831 (2020) - [i14]Michele Ciampi, Nikos Karayannidis, Aggelos Kiayias, Dionysis Zindros:
Updatable Blockchains. IACR Cryptol. ePrint Arch. 2020: 887 (2020) - [i13]Michele Ciampi, Alexandru Cojocaru, Elham Kashefi, Atul Mantri:
Secure Quantum Two-Party Computation: Impossibility and Constructions. IACR Cryptol. ePrint Arch. 2020: 1286 (2020) - [i12]Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas:
Round-Optimal and Communication-Efficient Multiparty Computation. IACR Cryptol. ePrint Arch. 2020: 1437 (2020)
2010 – 2019
- 2019
- [i11]Michele Ciampi, Rafail Ostrovsky:
Four-Round Secure Multiparty Computation from General Assumptions. IACR Cryptol. ePrint Arch. 2019: 214 (2019) - [i10]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
On Round Optimal Secure Multiparty Computation from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2019: 216 (2019) - [i9]Aydin Abadi, Michele Ciampi, Aggelos Kiayias, Vassilis Zikas:
Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-. IACR Cryptol. ePrint Arch. 2019: 644 (2019) - 2018
- [c8]Michele Ciampi, Claudio Orlandi:
Combining Private Set-Intersection with Secure Two-Party Computation. SCN 2018: 464-482 - [i8]Michele Ciampi, Claudio Orlandi:
Combining Private Set-Intersection with Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2018: 105 (2018) - 2017
- [c7]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions. CRYPTO (2) 2017: 127-157 - [c6]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. TCC (1) 2017: 678-710 - [c5]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. TCC (1) 2017: 711-742 - [i7]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2017: 920 (2017) - [i6]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. IACR Cryptol. ePrint Arch. 2017: 931 (2017) - 2016
- [c4]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Concurrent Non-Malleable Commitments (and More) in 3 Rounds. CRYPTO (3) 2016: 270-299 - [c3]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Online/Offline OR Composition of Sigma Protocols. EUROCRYPT (2) 2016: 63-92 - [c2]Michele Ciampi, Giuseppe Persiano, Luisa Siniscalchi, Ivan Visconti:
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles. TCC (A2) 2016: 83-111 - [c1]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Improved OR-Composition of Sigma-Protocols. TCC (A2) 2016: 112-141 - [i5]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Online/Offline OR Composition of Sigma Protocols. IACR Cryptol. ePrint Arch. 2016: 175 (2016) - [i4]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Concurrent Non-Malleable Commitments (and More) in 3 Rounds. IACR Cryptol. ePrint Arch. 2016: 566 (2016) - [i3]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
On Round-Efficient Non-Malleable Protocols. IACR Cryptol. ePrint Arch. 2016: 621 (2016) - 2015
- [i2]Michele Ciampi, Giuseppe Persiano, Luisa Siniscalchi, Ivan Visconti:
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles. IACR Cryptol. ePrint Arch. 2015: 770 (2015) - [i1]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Improved OR Composition of Sigma-Protocols. IACR Cryptol. ePrint Arch. 2015: 810 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
