Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-article
Real-World Universal zkSNARKs are Non-Malleable
CCS '24: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security•December 2024, pp 3138-3151• https://doi.org/10.1145/3658644.3690351Simulation extractability is a strong security notion of zkSNARKs that guarantees that an attacker who produces a valid proof must know the corresponding witness, even if the attacker had prior access to proofs generated by other users. Notably, ...
- Article
Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions
Advances in Cryptology – CRYPTO 2024•August 2024, pp 317-351• https://doi.org/10.1007/978-3-031-68382-4_10AbstractMulti-Key Homomorphic Signatures (MKHS) allow one to evaluate a function on data signed by distinct users while producing a succinct and publicly-verifiable certificate of the correctness of the result. All the constructions of MKHS in the state ...
- Article
Witness Encryption for Succinct Functional Commitments and Applications
Public-Key Cryptography – PKC 2024•April 2024, pp 132-167• https://doi.org/10.1007/978-3-031-57722-2_5AbstractWitness encryption (WE), introduced by Garg, Gentry, Sahai, and Waters (STOC 2013) allows one to encrypt a message to a statement for some NP language , such that any user holding a witness for can decrypt the ciphertext. The extreme power of this ...
- Article
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees
Public-Key Cryptography – PKC 2024•April 2024, pp 337-369• https://doi.org/10.1007/978-3-031-57722-2_11AbstractLookup arguments allow to prove that the elements of a committed vector come from a (bigger) committed table. They enable novel approaches to reduce the prover complexity of general-purpose zkSNARKs, implementing “non-arithmetic operations" such ...
- Article
Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces
Advances in Cryptology – ASIACRYPT 2023•December 2023, pp 166-200• https://doi.org/10.1007/978-981-99-8733-7_6AbstractRegistration-Based Encryption (RBE) [Garg et al. TCC’18] is a public-key encryption mechanism in which users generate their own public and secret keys, and register their public keys with a central authority called the key curator. Similarly to ...
- Article
From Polynomial IOP and Commitments to Non-malleable zkSNARKs
AbstractWe study sufficient conditions to compile simulation-extractable zkSNARKs from information-theoretic interactive oracle proofs (IOP) using a simulation-extractable commit-and-prove system for its oracles. Specifically, we define simulation ...
- Article
Chainable Functional Commitments for Unbounded-Depth Circuits
AbstractA functional commitment (FC) scheme allows one to commit to a vector and later produce a short opening proof of for any admissible function f. Since their inception, FC schemes supporting ever more expressive classes of functions have ...
- research-article
Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing
CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security•November 2023, pp 1437-1451• https://doi.org/10.1145/3576915.3623160Cryptographic proof systems provide integrity, fairness, and privacy in applications that outsource data processing tasks. However, general-purpose proof systems do not scale well to large inputs. At the same time, ad-hoc solutions for concrete ...
- research-article
Zero-knowledge proofs for set membership: efficient, succinct, modular
Designs, Codes and Cryptography, Volume 91, Issue 11•Nov 2023, pp 3457-3525 • https://doi.org/10.1007/s10623-023-01245-1AbstractWe consider the problem of proving in zero knowledge that an element of a public set satisfies a given property without disclosing the element, i.e., for some u, “ and P(u) holds”. This problem arises in many applications (anonymous ...
- Article
Efficient and Universally Composable Single Secret Leader Election from Pairings
Public-Key Cryptography – PKC 2023•May 2023, pp 471-499• https://doi.org/10.1007/978-3-031-31368-4_17AbstractSingle Secret Leader Election (SSLE) protocols allow a set of users to elect a leader among them so that the identity of the winner remains secret until she decides to reveal herself. This notion was formalized and implemented in a recent result ...
- Article
Extendable Threshold Ring Signatures with Enhanced Anonymity
Public-Key Cryptography – PKC 2023•May 2023, pp 281-311• https://doi.org/10.1007/978-3-031-31368-4_11AbstractThreshold ring signatures are digital signatures that allow t parties to sign a message while hiding their identity in a larger set of n users called “ring”. Recently, Aranha et al. [PKC 2022] introduced the notion of extendable threshold ring ...
- Article
Unilaterally-Authenticated Key Exchange
Financial Cryptography and Data Security•April 2017, pp 542-560• https://doi.org/10.1007/978-3-319-70972-7_31AbstractKey Exchange (KE), which enables two parties (e.g., a client and a server) to securely establish a common private key while communicating over an insecure channel, is one of the most fundamental cryptographic primitives. In this work, we address ...
- Article
Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures
Advances in Cryptology – ASIACRYPT 2022•December 2022, pp 159-188• https://doi.org/10.1007/978-3-031-22972-5_6AbstractFunctional Commitments (FC) allow one to reveal functions of committed data in a succinct and verifiable way. In this paper we put forward the notion of additive-homomorphic FC and show two efficient, pairing-based, realizations of this primitive ...
- Article
On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups
AbstractVector Commitments allow one to (concisely) commit to a vector of messages so that one can later (concisely) open the commitment at selected locations. In the state of the art of vector commitments, algebraic constructions have emerged as a ...
- research-article
Succinct Zero-Knowledge Batch Proofs for Set Accumulators
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security•November 2022, pp 455-469• https://doi.org/10.1145/3548606.3560677Cryptographic accumulators are a common solution to proving information about a large set S. They allow one to compute a short digest of S and short certificates of some of its basic properties, notably membership of an element. Accumulators also allow ...
- research-article
Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security•November 2022, pp 1067-1080• https://doi.org/10.1145/3548606.3560630We study the problem of privacy-preserving proofs on streamed authenticated data. In this setting, a server receives a continuous stream of data from a trusted data provider, and is requested to prove computations over the data to third parties in a ...
- Article
Ring Signatures with User-Controlled Linkability
Computer Security – ESORICS 2022•September 2022, pp 405-426• https://doi.org/10.1007/978-3-031-17146-8_20AbstractAnonymous authentication primitives, e.g., group or ring signatures, allow one to realize privacy-preserving data collection applications, as they strike a balance between authenticity of data being collected and privacy of data providers. At PKC ...
- Article
Inner Product Functional Commitments with Constant-Size Public Parameters and Openings
Security and Cryptography for Networks•September 2022, pp 639-662• https://doi.org/10.1007/978-3-031-14791-3_28AbstractFunctional commitments (Libert et al. [ICALP’16]) allow a party to commit to a vector of length n and later open the commitment at functions of the committed vector succinctly, namely with communication logarithmic or constant in n. Existing ...
- research-article
Adaptively Secure Single Secret Leader Election from DDH
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing•July 2022, pp 430-439• https://doi.org/10.1145/3519270.3538424Single Secret Leader Election protocols (SSLE, for short) allow a group of users to select a random leader so that the latter remains secret until she decides to reveal herself. Thanks to this feature, SSLE can be used to build an election mechanism for ...
- Article
Progressive and Efficient Verification for Digital Signatures
Applied Cryptography and Network Security•June 2022, pp 440-458• https://doi.org/10.1007/978-3-031-09234-3_22AbstractDigital signatures are widely deployed to authenticate the source of incoming information, or to certify data integrity. Common signature verification procedures return a decision (accept/reject) only at the very end of the execution. If ...
