Alessandro Chiesa
Alessandro Chiesa
Verified email at berkeley.edu - Homepage
TitleCited byYear
Zerocash: Decentralized anonymous payments from bitcoin
EB Sasson, A Chiesa, C Garman, M Green, I Miers, E Tromer, M Virza
2014 IEEE Symposium on Security and Privacy, 459-474, 2014
7872014
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
E Ben-Sasson, A Chiesa, D Genkin, Tromer, Eran, M Virza
33rd International Cryptology Conference (CRYPTO 2013), 2013
3372013
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
N Bitansky, R Canetti, A Chiesa, E Tromer
3rd Innovations in Theoretical Computer Science Conference (ITCS 2012), 326-349, 2012
2592012
Succinct non-interactive zero knowledge for a von Neumann architecture
E Ben-Sasson, A Chiesa, E Tromer, M Virza
Cryptology ePrint Archive, Report 2013/879, 2 013, 2013
2552013
Recursive composition and bootstrapping for SNARKs and proof-carrying data
N Bitansky, R Canetti, A Chiesa, E Tromer
45th Symposium on the Theory of Computing (STOC 2013), 2012
1802012
Succinct Non-Interactive Arguments via Linear Interactive Proofs
N Bitansky, A Chiesa, Y Ishai, R Ostrovsky, O Paneth
10th Theory of Cryptography Conference (TCC 2013), 315-333, 2012
1742012
Scalable zero knowledge via cycles of elliptic curves
E Ben-Sasson, A Chiesa, E Tromer, M Virza
Algorithmica 79 (4), 1102-1160, 2017
1232017
Secure sampling of public parameters for succinct zero knowledge proofs
E Ben-Sasson, A Chiesa, M Green, E Tromer, M Virza
2015 IEEE Symposium on Security and Privacy, 287-304, 2015
832015
The hunting of the SNARK
N Bitansky, R Canetti, A Chiesa, S Goldwasser, H Lin, A Rubinstein, ...
Journal of Cryptology 30 (4), 989-1066, 2017
752017
Interactive oracle proofs
E Ben-Sasson, A Chiesa, N Spooner
Theory of Cryptography Conference, 31-60, 2016
692016
On the concrete-efficiency of probabilistically-checkable proofs
E Ben-Sasson, A Chiesa, D Genkin, E Tromer
45th Symposium on the Theory of Computing (STOC 2013), 2012
67*2012
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
E Ben-Sasson, A Chiesa, D Genkin, E Tromer
4th Symposium on Innovations in Theoretical Computer Science (ITCS 2013 …, 2012
672012
Computational integrity with a public random string from quasi-linear PCPs
E Ben-Sasson, I Bentov, A Chiesa, A Gabizon, D Genkin, M Hamilis, ...
Annual International Conference on the Theory and Applications of …, 2017
462017
Cluster computing in zero knowledge
A Chiesa, E Tromer, M Virza
Annual International Conference on the Theory and Applications of …, 2015
442015
Proof-carrying data and hearsay arguments from signature cards
A Chiesa, E Tromer
1st Symposium on Innovations in Computer Science (ICS 2010), 310-331, 2010
442010
Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits
N Bitansky, A Chiesa
32nd International Cryptology Conference (CRYPTO 2012), 255-272, 2012
372012
Aurora: Transparent succinct arguments for R1CS
E Ben-Sasson, A Chiesa, M Riabzev, N Spooner, M Virza, NP Ward
Annual International Conference on the Theory and Applications of …, 2019
282019
Decentralized anonymous micropayments
A Chiesa, M Green, J Liu, P Miao, I Miers, P Mishra
Annual International Conference on the Theory and Applications of …, 2017
252017
Quasi-linear size zero knowledge from linear-algebraic PCPs
E Ben-Sasson, A Chiesa, A Gabizon, M Virza
Theory of Cryptography Conference, 33-64, 2016
252016
Oblix: An efficient oblivious search index
P Mishra, R Poddar, J Chen, A Chiesa, RA Popa
2018 IEEE Symposium on Security and Privacy (SP), 279-296, 2018
222018
The system can't perform the operation now. Try again later.
Articles 1–20