Joseph Bonneau
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Joseph Bonneau has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Miranda Christ
Columbia University, New York, USA
3 shared publications - Arasu Arun
New York University
2 shared publications - Mahimna Kelkar
Cornell University, New York, NY, USA
2 shared publications - Nirvan Tyagi
Cornell University
2 shared publications - Aadityan Ganesh
Princeton University, Princeton, NJ, USA
1 shared publication - Aditi Partap
Stanford University, Stanford, CA, USA
1 shared publication
Latest Publications
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3505-3519
Breaking Omertà: On Threshold Cryptography, Smart Collusion, and Whistleblowing
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3505-3519
Open AccessBreaking Omertà: On Threshold Cryptography, Smart Collusion, and Whistleblowing
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 170-202
Merkle Mountain Ranges are Optimal: On Witness Update Frequency for Cryptographic Accumulators
- 17 August 2025
- Published by Springer Nature
- p. 170-202
Open AccessMerkle Mountain Ranges are Optimal: On Witness Update Frequency for Cryptographic Accumulators
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3227-3241
Atomic and Fair Data Exchange via Blockchain
We introduce a blockchain Fair Data Exchange (FDE) protocol, enabling a storage server to transfer a data file to a client atomically: the client receives the file if and only if the server receives an agreed-upon payment. We put forth a new definition for a cryptographic scheme that we name verifiable encryption under committed key (VECK), and we propose two instantiations for this scheme. Our protocol relies on a blockchain to enforce the atomicity of the exchange and uses VECK to ensure that the client receives the correct data (matching an agreed-upon commitment) before releasing the payment for the decrypting key. Our protocol is trust-minimized and requires only constant-sized on-chain communication, concretely 3 signatures, 1 verification key, and 1 secret key, with most of the data stored and communicated off-chain. It also supports exchanging only a subset of the data, can amortize the server's work across multiple clients, and offers a general framework to design alternative FDE protocols using different commitment schemes. A prominent application of our protocol is the Danksharding data availability scheme on Ethereum, which commits to data via KZG polynomial commitments. We also provide an open-source implementation for our protocol with both instantiations for VECK, demonstrating our protocol's efficiency and practicality on Ethereum.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3227-3241
Open AccessAtomic and Fair Data Exchange via Blockchain
We introduce a blockchain Fair Data Exchange (FDE) protocol, enabling a storage server to transfer a data file to a client atomically: the client receives the file if and only if the server receives an agreed-upon payment. We put forth a new definition for a cryptographic scheme that we name verifiable encryption under committed key (VECK), and we propose two instantiations for this scheme. Our protocol relies on a blockchain to enforce the atomicity of the exchange and uses VECK to ensure that the client receives the correct data (matching an agreed-upon commitment) before releasing the payment for the decrypting key. Our protocol is trust-minimized and requires only constant-sized on-chain communication, concretely 3 signatures, 1 verification key, and 1 secret key, with most of the data stored and communicated off-chain. It also supports exchanging only a subset of the data, can amortize the server's work across multiple clients, and offers a general framework to design alternative FDE protocols using different commitment schemes. A prominent application of our protocol is the Danksharding data availability scheme on Ethereum, which commits to data via KZG polynomial commitments. We also provide an open-source implementation for our protocol with both instantiations for VECK, demonstrating our protocol's efficiency and practicality on Ethereum.
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 673-692
NOPE: Strengthening domain authentication with succinct proofs
Server authentication assures users that they are communicating with a server that genuinely represents a claimed domain. Today, server authentication relies on certification authorities (CAs), third parties who sign statements binding public keys to domains. CAs remain a weak spot in Internet security, as any faulty CA can issue a certificate for any domain. This paper describes the design, implementation, and experimental evaluation of nope, a new mechanism for server authentication that uses succinct proofs (for example, zero-knowledge proofs) to prove that a DNSSEC chain exists that links a public key to a specified domain. The use of DNSSEC dramatically reduces reliance on CAs, and the small size of the proofs enables compatibility with legacy infrastructure, including TLS servers, certificate formats, and certificate transparency. nope proofs add minimal performance overhead to clients, increasing the size of a typical certificate chain by about 10% and requiring just over 1 ms to verify. nope's core technical contributions (which generalize beyond nope) include efficient techniques for representing parsing and cryptographic operations within succinct proofs, which reduce proof generation time and memory requirements by nearly an order of magnitude.
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 673-692
Open AccessNOPE: Strengthening domain authentication with succinct proofs
Server authentication assures users that they are communicating with a server that genuinely represents a claimed domain. Today, server authentication relies on certification authorities (CAs), third parties who sign statements binding public keys to domains. CAs remain a weak spot in Internet security, as any faulty CA can issue a certificate for any domain. This paper describes the design, implementation, and experimental evaluation of nope, a new mechanism for server authentication that uses succinct proofs (for example, zero-knowledge proofs) to prove that a DNSSEC chain exists that links a public key to a specified domain. The use of DNSSEC dramatically reduces reliance on CAs, and the small size of the proofs enables compatibility with legacy infrastructure, including TLS servers, certificate formats, and certificate transparency. nope proofs add minimal performance overhead to clients, increasing the size of a typical certificate chain by about 10% and requiring just over 1 ms to verify. nope's core technical contributions (which generalize beyond nope) include efficient techniques for representing parsing and cryptographic operations within succinct proofs, which reduce proof generation time and memory requirements by nearly an order of magnitude.
- 1 December 2023
- Published by Springer Nature
- p. 235-251
Bicorn: An Optimistically Efficient Distributed Randomness Beacon
- 1 December 2023
- Published by Springer Nature
- p. 235-251
Bicorn: An Optimistically Efficient Distributed Randomness Beacon
- Open Access
- 1 December 2023
- Published by Springer Nature
- p. 18-35
Proof of Necessary Work: Succinct State Verification with Fairness Guarantees
Blockchain-based payment systems utilize an append-only log of transactions whose correctness can be verified by any observer. Classically, verification costs grow linearly in either the number of transactions or blocks in the blockchain (often both). Incrementally Verifiable Computation (IVC) can be used to enable constant-time verification, but generating the necessary proofs is expensive. We introduce the notion of Proof of Necessary Work (PoNW), in which proof generation is an integral part of the proof-of-work used in Nakamoto consensus, producing proofs using energy that would otherwise be wasted. We implement and benchmark a prototype of our system, enabling stateless clients to verify the entire blockchain history in about 40 milliseconds.
- 1 December 2023
- Published by Springer Nature
- p. 18-35
Open AccessProof of Necessary Work: Succinct State Verification with Fairness Guarantees
Blockchain-based payment systems utilize an append-only log of transactions whose correctness can be verified by any observer. Classically, verification costs grow linearly in either the number of transactions or blocks in the blockchain (often both). Incrementally Verifiable Computation (IVC) can be used to enable constant-time verification, but generating the necessary proofs is expensive. We introduce the notion of Proof of Necessary Work (PoNW), in which proof generation is an integral part of the proof-of-work used in Nakamoto consensus, producing proofs using energy that would otherwise be wasted. We implement and benchmark a prototype of our system, enabling stateless clients to verify the entire blockchain history in about 40 milliseconds.
- 1 December 2023
- Published by Springer Nature
- p. 54-71
Limits on Revocable Proof Systems, With Implications for Stateless Blockchains
- 1 December 2023
- Published by Springer Nature
- p. 54-71
Limits on Revocable Proof Systems, With Implications for Stateless Blockchains
- Open Access
- 15 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1227-1241
Riggs: Decentralized Sealed-Bid Auctions
We introduce the first practical protocols for fully decentralized sealed-bid auctions using timed commitments. Timed commitments ensure that the auction is finalized fairly even if all participants drop out after posting bids or if n bidders collude to try to learn the nth bidder's bid value. Our protocols rely on a novel non-malleable timed commitment scheme which efficiently supports range proofs to establish that bidders have sufficient funds to cover a hidden bid value. This allows us to penalize users who abandon bids for exactly the bid value, while supporting simultaneous bidding in multiple auctions with a shared collateral pool. Our protocols are concretely efficient and we have implemented them in an Ethereum-compatible smart contract which automatically enforces payment and delivery of an auctioned digital asset.
- 15 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1227-1241
Open AccessRiggs: Decentralized Sealed-Bid Auctions
We introduce the first practical protocols for fully decentralized sealed-bid auctions using timed commitments. Timed commitments ensure that the auction is finalized fairly even if all participants drop out after posting bids or if n bidders collude to try to learn the nth bidder's bid value. Our protocols rely on a novel non-malleable timed commitment scheme which efficiently supports range proofs to establish that bidders have sufficient funds to cover a hidden bid value. This allows us to penalize users who abandon bids for exactly the bid value, while supporting simultaneous bidding in multiple auctions with a shared collateral pool. Our protocols are concretely efficient and we have implemented them in an Ethereum-compatible smart contract which automatically enforces payment and delivery of an auctioned digital asset.