default search action
Alessandro Chiesa
Person information
- affiliation: UC Berkeley, CA, USA
- affiliation: EPFL, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c58]Gal Arnon
, Alessandro Chiesa, Giacomo Fenzi
STIR: Reed-Solomon Proximity Testing with Fewer Queries. CRYPTO (10) 2024: 380-413 - [c57]Alessandro Chiesa, Ziyi Guan, Burcu Yildiz:
On Parallel Repetition of PCPs. ITCS 2024: 34:1-34:14 - [i80]Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev:
STIR: Reed-Solomon Proximity Testing with Fewer Queries. IACR Cryptol. ePrint Arch. 2024: 390 (2024) - [i79]Alessandro Chiesa, Elisabetta Fedele, Giacomo Fenzi, Andrew Zitek-Estrada:
A Time-Space Tradeoff for the Sumcheck Prover. IACR Cryptol. ePrint Arch. 2024: 524 (2024) - [i78]Alessandro Chiesa, Giacomo Fenzi:
zkSNARKs in the ROM with Unconditional UC-Security. IACR Cryptol. ePrint Arch. 2024: 724 (2024) - [i77]Annalisa Barbara, Alessandro Chiesa, Ziyi Guan:
Relativized Succinct Arguments in the ROM Do Not Exist. IACR Cryptol. ePrint Arch. 2024: 728 (2024) - [i76]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev:
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. IACR Cryptol. ePrint Arch. 2024: 1434 (2024) - [i75]Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev:
WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification. IACR Cryptol. ePrint Arch. 2024: 1586 (2024) - 2023
- [c56]Jonathan Bootle
Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. CRYPTO (2) 2023: 227-251 - [c55]Megan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner:
Proof-Carrying Data from Arithmetized Random Oracles. EUROCRYPT (2) 2023: 379-404 - [c54]Gal Arnon
IOPs with Inverse Polynomial Soundness Error. FOCS 2023: 752-761 - [c53]Alessandro Chiesa, Ryan Lehmkuhl, Pratyush Mishra, Yinuo Zhang:
Eos: Efficient Private Delegation of zkSNARK Provers. USENIX Security Symposium 2023: 6453-6469 - [i74]Megan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner:
Proof-Carrying Data From Arithmetized Random Oracles. IACR Cryptol. ePrint Arch. 2023: 587 (2023) - [i73]Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki
Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. IACR Cryptol. ePrint Arch. 2023: 930 (2023) - [i72]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
IOPs with Inverse Polynomial Soundness Error. IACR Cryptol. ePrint Arch. 2023: 1062 (2023) - [i71]Alessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev:
Security Bounds for Proof-Carrying Data from Straightline Extractors. IACR Cryptol. ePrint Arch. 2023: 1646 (2023) - [i70]Alessandro Chiesa, Ziyi Guan, Burcu Yildiz:
On Parallel Repetition of PCPs. IACR Cryptol. ePrint Arch. 2023: 1714 (2023) - [i69]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner:
Concrete Security for Succinct Arguments from Vector Commitments. IACR Cryptol. ePrint Arch. 2023: 1737 (2023) - 2022
- [j10]Alessandro Chiesa
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. J. ACM 69(2): 15:1-15:44 (2022) - [j9]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. J. Cryptol. 35(3): 15 (2022) - [j8]Alessandro Chiesa, Tom Gur
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity. SIAM J. Comput. 51(6): 1839-1865 (2022) - [c52]Gal Arnon
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. CCC 2022: 24:1-24:16 - [c51]Gal Arnon
A PCP Theorem for Interactive Proofs and Applications. EUROCRYPT (2) 2022: 64-94 - [c50]Jonathan Bootle
Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier. EUROCRYPT (2) 2022: 275-304 - [c49]Megan Chen, Alessandro Chiesa, Nicholas Spooner:
On Succinct Non-interactive Arguments in Relativized Worlds. EUROCRYPT (2) 2022: 336-366 - [c48]Jonathan Bootle
Gemini: Elastic SNARKs for Diverse Environments. EUROCRYPT (2) 2022: 427-457 - [c47]Gal Arnon
A Toolbox for Barriers on Interactive Oracle Proofs. TCC (1) 2022: 447-466 - [i68]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2022: 168 (2022) - [i67]Megan Chen, Alessandro Chiesa, Nicholas Spooner:
On Succinct Non-Interactive Arguments in Relativized Worlds. IACR Cryptol. ePrint Arch. 2022: 383 (2022) - [i66]Jonathan Bootle, Alessandro Chiesa, Yuncong Hu, Michele Orrù:
Gemini: Elastic SNARKs for Diverse Environments. IACR Cryptol. ePrint Arch. 2022: 420 (2022) - [i65]Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev:
A Toolbox for Barriers on Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2022: 790 (2022) - [i64]Jonathan Bootle, Alessandro Chiesa, Ziyi Guan, Siqi Liu:
Linear-Time Probabilistic Proofs with Sublinear Verification for Algebraic Automata Over Every Field. IACR Cryptol. ePrint Arch. 2022: 1056 (2022) - 2021
- [c46]Benedikt Bünz, Alessandro Chiesa, William Lin, Pratyush Mishra, Nicholas Spooner:
Proof-Carrying Data Without Succinct Arguments. CRYPTO (1) 2021: 681-710 - [c45]Alessandro Chiesa, Eylon Yogev:
Subquadratic SNARGs in the Random Oracle Model. CRYPTO (1) 2021: 711-741 - [c44]Jonathan Bootle
Sumcheck Arguments and Their Applications. CRYPTO (1) 2021: 742-773 - [c43]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier. FOCS 2021: 49-58 - [c42]Alessandro Chiesa, Eylon Yogev:
Tight Security Bounds for Micali's SNARGs. TCC (1) 2021: 401-434 - [i63]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. CoRR abs/2103.08140 (2021) - [i62]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. Electron. Colloquium Comput. Complex. TR21 (2021) - [i61]Alessandro Chiesa, Eylon Yogev:
Tight Security Bounds for Micali's SNARGs. IACR Cryptol. ePrint Arch. 2021: 188 (2021) - [i60]Alessandro Chiesa, Eylon Yogev:
Subquadratic SNARGs in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2021: 281 (2021) - [i59]Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki
Sumcheck Arguments and their Applications. IACR Cryptol. ePrint Arch. 2021: 333 (2021) - [i58]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. IACR Cryptol. ePrint Arch. 2021: 334 (2021) - [i57]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
A PCP Theorem for Interactive Proofs. IACR Cryptol. ePrint Arch. 2021: 915 (2021) - 2020
- [j7]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Axis-Parallel Tests for Tensor Product Codes. Theory Comput. 16: 1-34 (2020) - [j6]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Testing Linearity against Non-signaling Strategies. ACM Trans. Comput. Theory 12(3): 16:1-16:51 (2020) - [c41]Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Psi Vesely, Nicholas P. Ward:
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. EUROCRYPT (1) 2020: 738-768 - [c40]Alessandro Chiesa, Dev Ojha, Nicholas Spooner:
Fractal: Post-quantum and Transparent Recursive Proofs from Holography. EUROCRYPT (1) 2020: 769-793 - [c39]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Local Testability in the Non-Signaling Setting. ITCS 2020: 26:1-26:37 - [c38]Alessandro Chiesa, Siqi Liu:
On the Impossibility of Probabilistic Proofs in Relativized Worlds. ITCS 2020: 57:1-57:30 - [c37]Alessandro Chiesa, Tom Gur
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity. SODA 2020: 1395-1411 - [c36]Sean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers, Pratyush Mishra, Howard Wu:
ZEXE: Enabling Decentralized Private Computation. SP 2020: 947-964 - [c35]Benedikt Bünz, Alessandro Chiesa, Pratyush Mishra, Nicholas Spooner:
Recursive Proof Composition from Accumulation Schemes. TCC (2) 2020: 1-18 - [c34]Jonathan Bootle
Linear-Time Arguments with Sublinear Verification from Tensor Codes. TCC (2) 2020: 19-46 - [c33]Alessandro Chiesa, Eylon Yogev:
Barriers for Succinct Arguments in the Random Oracle Model. TCC (2) 2020: 47-76 - [i56]Alessandro Chiesa, Tom Gur, Igor Shinkar:
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - [i55]Benedikt Bünz, Alessandro Chiesa, Pratyush Mishra
Proof-Carrying Data from Accumulation Schemes. IACR Cryptol. ePrint Arch. 2020: 499 (2020) - [i54]Jonathan Bootle, Alessandro Chiesa, Jens Groth:
Linear-Time Arguments with Sublinear Verification from Tensor Codes. IACR Cryptol. ePrint Arch. 2020: 1426 (2020) - [i53]Alessandro Chiesa, Eylon Yogev:
Barriers for Succinct Arguments in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2020: 1427 (2020) - [i52]Weikeng Chen, Alessandro Chiesa, Emma Dauterman, Nicholas P. Ward:
Reducing Participation Costs via Incremental Verification for Ledger Systems. IACR Cryptol. ePrint Arch. 2020: 1522 (2020) - [i51]Jonathan Bootle, Alessandro Chiesa, Siqi Liu:
Zero-Knowledge Succinct Arguments with a Linear-Time Prover. IACR Cryptol. ePrint Arch. 2020: 1527 (2020) - [i50]Benedikt Bünz, Alessandro Chiesa, William Lin, Pratyush Mishra
Proof-Carrying Data without Succinct Arguments. IACR Cryptol. ePrint Arch. 2020: 1618 (2020)
2010 – 2019
- 2019
- [j5]Alessandro Chiesa, Lynn Chua, Matthew Weidner:
On Cycles of Pairing-Friendly Elliptic Curves. SIAM J. Appl. Algebra Geom. 3(2): 175-192 (2019) - [c32]Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner
Aurora: Transparent Succinct Arguments for R1CS. EUROCRYPT (1) 2019: 103-128 - [c31]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing. ITCS 2019: 25:1-25:17 - [c30]Alessandro Chiesa, Peter Manohar, Nicholas Spooner:
Succinct Arguments in the Quantum Random Oracle Model. TCC (2) 2019: 1-29 - [c29]Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur
Linear-Size Constant-Query IOPs for Delegating Computation. TCC (2) 2019: 494-521 - [i49]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Local Testability in the Non-Signaling Setting. Electron. Colloquium Comput. Complex. TR19 (2019) - [i48]Alessandro Chiesa, Peter Manohar, Nicholas Spooner:
Succinct Arguments in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2019: 834 (2019) - [i47]Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. IACR Cryptol. ePrint Arch. 2019: 1047 (2019) - [i46]Alessandro Chiesa, Dev Ojha, Nicholas Spooner:
Fractal: Post-Quantum and Transparent Recursive Proofs from Holography. IACR Cryptol. ePrint Arch. 2019: 1076 (2019) - [i45]Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner:
Linear-Size Constant-Query IOPs for Delegating Computation. IACR Cryptol. ePrint Arch. 2019: 1230 (2019) - [i44]Alessandro Chiesa, Siqi Liu:
On the Impossibility of Probabilistic Proofs in Relativized Worlds. IACR Cryptol. ePrint Arch. 2019: 1430 (2019) - 2018
- [c28]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Testing Linearity against Non-Signaling Strategies. CCC 2018: 17:1-17:37 - [c27]Alessandro Chiesa, Michael A. Forbes, Tom Gur
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. FOCS 2018: 755-765 - [c26]Alessandro Chiesa, Tom Gur:
Proofs of Proximity for Distribution Testing. ITCS 2018: 53:1-53:14 - [c25]Pratyush Mishra, Rishabh Poddar, Jerry Chen, Alessandro Chiesa, Raluca Ada Popa:
Oblix: An Efficient Oblivious Search Index. IEEE Symposium on Security and Privacy 2018: 279-296 - [c24]Howard Wu, Wenting Zheng, Alessandro Chiesa, Raluca Ada Popa, Ion Stoica:
DIZK: A Distributed Zero Knowledge Proof System. USENIX Security Symposium 2018: 675-692 - [i43]Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner:
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. CoRR abs/1803.01519 (2018) - [i42]Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner:
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. Electron. Colloquium Comput. Complex. TR18 (2018) - [i41]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Testing Linearity against Non-Signaling Strategies. Electron. Colloquium Comput. Complex. TR18 (2018) - [i40]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Probabilistic Checking against Non-Signaling Strategies from Linearity Testing. Electron. Colloquium Comput. Complex. TR18 (2018) - [i39]Howard Wu, Wenting Zheng, Alessandro Chiesa, Raluca Ada Popa, Ion Stoica:
DIZK: A Distributed Zero Knowledge Proof System. IACR Cryptol. ePrint Arch. 2018: 691 (2018) - [i38]Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward:
Aurora: Transparent Succinct Arguments for R1CS. IACR Cryptol. ePrint Arch. 2018: 828 (2018) - [i37]Sean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers, Pratyush Mishra
Zexe: Enabling Decentralized Private Computation. IACR Cryptol. ePrint Arch. 2018: 962 (2018) - 2017
- [j4]Eli Ben-Sasson, Alessandro Chiesa
Scalable Zero Knowledge Via Cycles of Elliptic Curves. Algorithmica 79(4): 1102-1160 (2017) - [j3]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer:
The Hunting of the SNARK. J. Cryptol. 30(4): 989-1066 (2017) - [c23]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Axis-Parallel Tests for Tensor Product Codes. APPROX-RANDOM 2017: 39:1-39:22 - [c22]Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza:
Computational Integrity with a Public Random String from Quasi-Linear PCPs. EUROCRYPT (3) 2017: 551-579 - [c21]Alessandro Chiesa, Matthew Green, Jingcheng Liu, Peihan Miao, Ian Miers, Pratyush Mishra:
Decentralized Anonymous Micropayments. EUROCRYPT (2) 2017: 609-642 - [c20]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
Interactive Oracle Proofs with Constant Rate and Query Complexity. ICALP 2017: 40:1-40:15 - [c19]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
Zero Knowledge Protocols from Succinct Constraint Detection. TCC (2) 2017: 172-206 - [i36]Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner:
A Zero Knowledge Sumcheck and its Applications. CoRR abs/1704.02086 (2017) - [i35]Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner:
A Zero Knowledge Sumcheck and its Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i34]Alessandro Chiesa, Tom Gur:
Proofs of Proximity for Distribution Testing. Electron. Colloquium Comput. Complex. TR17 (2017) - [i33]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Axis-Parallel Tests for Tensor Product Codes. Electron. Colloquium Comput. Complex. TR17 (2017) - [i32]Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner:
A Zero Knowledge Sumcheck and its Applications. IACR Cryptol. ePrint Arch. 2017: 305 (2017) - 2016
- [c18]Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner
Interactive Oracle Proofs. TCC (B2) 2016: 31-60 - [c17]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. TCC (A2) 2016: 33-64 - [i31]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. CoRR abs/1610.03798 (2016) - [i30]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. Electron. Colloquium Comput. Complex. TR16 (2016) - [i29]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. Electron. Colloquium Comput. Complex. TR16 (2016) - [i28]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i27]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. IACR Cryptol. ePrint Arch. 2016: 21 (2016) - [i26]Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner:
Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2016: 116 (2016) - [i25]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. IACR Cryptol. ePrint Arch. 2016: 324 (2016) - [i24]Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza:
Computational integrity with a public random string from quasi-linear PCPs. IACR Cryptol. ePrint Arch. 2016: 646 (2016) - [i23]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. IACR Cryptol. ePrint Arch. 2016: 988 (2016) - [i22]Alessandro Chiesa, Matthew Green, Jingcheng Liu, Peihan Miao, Ian Miers, Pratyush Mishra:
Decentralized Anonymous Micropayments. IACR Cryptol. ePrint Arch. 2016: 1033 (2016) - 2015
- [j2]Alessandro Chiesa, Zeyuan Allen Zhu:
Shorter arithmetization of nondeterministic computations. Theor. Comput. Sci. 600: 107-131 (2015) - [c16]Alessandro Chiesa, Eran Tromer, Madars Virza:
Cluster Computing in Zero Knowledge. EUROCRYPT (2) 2015: 371-403 - [c15]Eli Ben-Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer, Madars Virza:
Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs. IEEE Symposium on Security and Privacy 2015: 287-304 - [i21]Alessandro Chiesa, Eran Tromer, Madars Virza:
Cluster Computing in Zero Knowledge. IACR Cryptol. ePrint Arch. 2015: 377 (2015) - 2014
- [b1]Alessandro Chiesa:
Succinct non-Interactive arguments. Massachusetts Institute of Technology, Cambridge, MA, USA, 2014 - [c14]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Scalable Zero Knowledge via Cycles of Elliptic Curves. CRYPTO (2) 2014: 276-294 - [c13]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian self uncertainty in the vcg mechanism for unrestricted combinatorial auctions. EC 2014: 619-620 - [c12]Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza:
Zerocash: Decentralized Anonymous Payments from Bitcoin. IEEE Symposium on Security and Privacy 2014: 459-474 - [c11]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. USENIX Security Symposium 2014: 781-796 - [i20]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Bridging Utility Maximization and Regret Minimization. CoRR abs/1403.6394 (2014) - [i19]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Robustness from Regret Minimization. CoRR abs/1403.6409 (2014) - [i18]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions. CoRR abs/1403.6410 (2014) - [i17]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Robustness of Single-Parameter Domains. CoRR abs/1403.6411 (2014) - [i16]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Robustness of the Vickrey Mechanism. CoRR abs/1403.6413 (2014) - [i15]Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza:
Zerocash: Decentralized Anonymous Payments from Bitcoin. IACR Cryptol. ePrint Arch. 2014: 349 (2014) - [i14]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer:
The Hunting of the SNARK. IACR Cryptol. ePrint Arch. 2014: 580 (2014) - [i13]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Scalable Zero Knowledge via Cycles of Elliptic Curves. IACR Cryptol. ePrint Arch. 2014: 595 (2014) - 2013
- [j1]Alessandro Chiesa, Michael A. Forbes:
Improved Soundness for QMA with Multiple Provers. Chic. J. Theor. Comput. Sci. 2013 (2013) - [c10]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza:
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. CRYPTO (2) 2013: 90-108 - [c9]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. ITCS 2013: 401-414 - [c8]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
Recursive composition and bootstrapping for SNARKS and proof-carrying data. STOC 2013: 111-120 - [c7]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
On the concrete efficiency of probabilistically-checkable proofs. STOC 2013: 585-594 - [c6]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013: 315-333 - [c5]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013 - [i12]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza:
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. IACR Cryptol. ePrint Arch. 2013: 507 (2013) - [i11]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Succinct Non-Interactive Arguments for a von Neumann Architecture. IACR Cryptol. ePrint Arch. 2013: 879 (2013) - 2012
- [c4]Nir Bitansky, Alessandro Chiesa:
Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. CRYPTO 2012: 255-272 - [c3]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Mechanism design with approximate valuations. ITCS 2012: 34-38 - [c2]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. ITCS 2012: 326-349 - [i10]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. Electron. Colloquium Comput. Complex. TR12 (2012) - [i9]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems. IACR Cryptol. ePrint Arch. 2012: 71 (2012) - [i8]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. IACR Cryptol. ePrint Arch. 2012: 95 (2012) - [i7]Nir Bitansky, Alessandro Chiesa:
Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits. IACR Cryptol. ePrint Arch. 2012: 461 (2012) - [i6]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. IACR Cryptol. ePrint Arch. 2012: 718 (2012) - 2011
- [i5]Raluca A. Popa, Alessandro Chiesa, Tural Badirkhanli, Muriel Médard:
Going Beyond Pollution Attacks: Forcing Byzantine Clients to Code Correctly. CoRR abs/1108.2080 (2011) - [i4]Alessandro Chiesa, Michael A. Forbes:
Improved Soundness for QMA with Multiple Provers. CoRR abs/1108.2098 (2011) - [i3]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Auctions. CoRR abs/1112.1147 (2011) - [i2]Alessandro Chiesa, Michael A. Forbes:
Improved Soundness for QMA with Multiple Provers. Electron. Colloquium Comput. Complex. TR11 (2011) - [i1]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. IACR Cryptol. ePrint Arch. 2011: 443 (2011) - 2010
- [c1]Alessandro Chiesa, Eran Tromer:
Proof-Carrying Data and Hearsay Arguments from Signature Cards. ICS 2010: 310-331
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-11-11 21:27 CET 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: