Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Eran Tromer
2010 – today
- 2013
[c19]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- [c18]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: Recursive composition and bootstrapping for SNARKS and proof-carrying data. STOC 2013: 111-120
- [c17]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer: On the concrete efficiency of probabilistically-checkable proofs. STOC 2013: 585-594
- [i9]Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan: On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2013: 94 (2013)
- 2012
- [j2]Shai Shalev-Shwartz, Ohad Shamir, Eran Tromer: Using More Data to Speed-up Training Time. Journal of Machine Learning Research - Proceedings Track 22: 1019-1027 (2012)
- [c16]Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. EUROCRYPT 2012: 483-501
- [c15]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
- [c14]Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. STOC 2012: 1219-1234
- [i8]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer: On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. Electronic Colloquium on Computational Complexity (ECCC) 19: 45 (2012)
- [i7]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer: Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems. IACR Cryptology ePrint Archive 2012: 71 (2012)
- [i6]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. IACR Cryptology ePrint Archive 2012: 95 (2012)
- 2011
- [r2]
- [i5]Shai Shalev-Shwartz, Ohad Shamir, Eran Tromer: Using More Data to Speed-up Training Time. CoRR abs/1106.1216 (2011)
- [i4]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. IACR Cryptology ePrint Archive 2011: 443 (2011)
- [i3]Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan: Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2011: 663 (2011)
- 2010
- [j1]Eran Tromer, Dag Arne Osvik, Adi Shamir: Efficient Cache Attacks on AES, and Countermeasures. J. Cryptology 23(1): 37-71 (2010)
- [c13]Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan: Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases. EUROCRYPT 2010: 135-156
- [c12]Alessandro Chiesa, Eran Tromer: Proof-Carrying Data and Hearsay Arguments from Signature Cards. ICS 2010: 310-331
2000 – 2009
- 2009
- [c11]Thomas Ristenpart, Eran Tromer, Hovav Shacham, Stefan Savage: Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds. ACM Conference on Computer and Communications Security 2009: 199-212
- [c10]Maxwell N. Krohn, Eran Tromer: Noninterference for a Practical DIFC-Based Operating System. IEEE Symposium on Security and Privacy 2009: 61-76
- [i2]Sebastian Faust, Leonid Reyzin, Eran Tromer: Protecting Circuits from Computationally-Bounded Leakage. IACR Cryptology ePrint Archive 2009: 379 (2009)
- 2008
- [c9]Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford: Path-quality monitoring in the presence of adversaries. SIGMETRICS 2008: 193-204
- 2006
- [c8]Dag Arne Osvik, Adi Shamir, Eran Tromer: Cache Attacks and Countermeasures: The Case of AES. CT-RSA 2006: 1-20
- 2005
- [c7]Willi Geiselmann, Adi Shamir, Rainer Steinwandt, Eran Tromer: Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization. CHES 2005: 131-146
- [c6]Willi Geiselmann, Hubert Köpfer, Rainer Steinwandt, Eran Tromer: Improved Routing-Based Linear Algebra for the Number Field Sieve. ITCC (1) 2005: 636-641
- [c5]Moni Naor, Asaf Nussboim, Eran Tromer: Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. TCC 2005: 66-85
- [r1]
- [i1]Dag Arne Osvik, Adi Shamir, Eran Tromer: Cache attacks and Countermeasures: the Case of AES. IACR Cryptology ePrint Archive 2005: 271 (2005)
- 2003
- [c4]Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James P. Hughes, Paul C. Leyland: Factoring Estimates for a 1024-Bit RSA Modulus. ASIACRYPT 2003: 55-74
- [c3]Boaz Barak, Ronen Shaltiel, Eran Tromer: True Random Number Generators Secure in a Changing Environment. CHES 2003: 166-180
- [c2]
- 2002
- [c1]Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer: Analysis of Bernstein's Factorization Circuit. ASIACRYPT 2002: 1-26
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-27 22:24 CEST by the dblp team