Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations |
Disambiguate
Tables:
DMCA
Toward practical argument systems . . . (2014)
Cached
Download Links
[www.cs.utexas.edu]
Save to List
Add to Collection
Correct Errors
Monitor Changes
by Srinath T. V. Setty
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
10435
Introduction to Algorithms
- Cormen, Leiserson, et al. - 1990
3247
Handbook of Applied Cryptography
- Menezes, Oorschot, et al. - 1997
3209
MapReduce: simplified data processing on large clusters
- Dean, Ghemawat - 2008
2169
Randomized Algorithms
- Motwani, Raghavan - 1995
1506
A public key cryptosystem and a signature scheme based on discrete logarithms
- ElGamal - 1985
1232
The knowledge complexity of interactive proof systems
- Goldwasser, Micali, et al. - 1989
1082
An algorithm for the machine calculation of complex fourier series
- Cooley, Tukey - 1965
914
Ridge regression: Biased estimation for nonorthogonal problems
- Hoerl, Kennard - 1970
791
Proof verification and the hardness of approximation problems
- Arora, Lund, et al. - 1998
488
Non-interactive and information-theoretic secure verifiable secret sharing
- Pedersen - 1991
479
What every computer scientist should know about floating-point arithmetic
- Goldberg - 1991
466
Byzantine quorum systems
- Malkhi, Reiter - 1998
412
Probabilistic checking of proofs: a new characterization of NP
- Arora, Safra - 1998
403
Practical Byzantine fault tolerance and proactive recovery
- Castro, Liskov - 2002
356
Self-testing/correcting with applications to numerical problems
- Blum, Luby, et al. - 1993
347
Computational Complexity: A Modern Approach
- Arora, Barak - 2009
338
Minimum disclosure proofs of knowledge
- Brassard, Chaum, et al. - 1988
335
Algebraic methods for interactive proof systems
- Lund, Fortnow, et al. - 1992
276
A digital signature based on a conventional encryption function
- Merkle - 1987
260
Checking computations in polylogarithmic time
- Babai, Fortnow, et al. - 1991
248
SIA: secure information aggregation in sensor networks
- Przydatek, Song, et al. - 2003
235
Capability-Based Computer Systems
- Levy - 1984
214
Pairing-friendly elliptic curves of prime order
- Barreto, Naehrig - 2006
213
Introduction to Modern Cryptography
- Katz, Lindell - 2008
205
Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Gennaro, Gentry, et al. - 2010
203
Fast and secure distributed read-only file system
- Fu, Kaashoek, et al. - 2000
198
A fully homomorphic encryption scheme
- Gentry
192
Generating hard instances of lattice problems
- Ajtai - 1996
184
D.: Secure untrusted data repository (sundr
- Li, Krohn, et al. - 2004
169
A note on efficient zero-knowledge proofs and arguments
- Kilian - 1992
165
The PCP theorem by gap amplification
- Dinur
161
Efficient probabilistically checkable proofs and applications to approximation
- BELLARE, GOLDWASSER, et al. - 1993
147
Multi-Prover interactive proofs: How to remove intractability assumptions
- BEN-OR, GOLDWASSER, et al. - 1988
138
Peerreview: practical accountability for distributed systems
- Haeberlen, Kouznetsov, et al. - 2007
130
Implementing Gentry’s fully-homomorphic encryption scheme
- Gentry, Halevi - 2011
129
Barycentric lagrange interpolation
- P, Trefethen - 2004
123
Relations Among Complexity Measures
- Pippenger, Fischer - 1979
120
M.: Checking the correctness of memories
- Blum, Evans, et al. - 1991
116
Computationally sound proofs
- Micali - 2000
113
New Proofs for NMAC and HMAC: Security without CollisionResistance
- Bellare
110
Delegating computation: Interactive proofs for Muggles
- Goldwasser, Kalai, et al. - 2008
100
How to build a trusted database system on untrusted storage
- Maheshwari, Vingralek, et al. - 2000
96
The confused deputy: (or why capabilities might have been invented
- Hardy - 1988
93
Merkle-damgård revisited: how to construct a hash function
- Coron, Dodis, et al. - 2005
89
Salil Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding
- Ben-Sasson, Goldreich, et al. - 2004
75
Uncheatable distributed computations
- Golle, Mironov - 2001
74
Separating succinct non-interactive arguments from all falsifiable assumptions
- Gentry, Wichs - 2011
74
Pioneer: Verifying integrity and guaranteeing execution of code on legacy platforms
- Seshadri, Luk, et al. - 2005
69
Improved delegation of computation using fully homomorphic encryption
- Chung, Kalai, et al.
68
Upright cluster services
- Clement, Kapritsos, et al. - 2009
68
Quadratic span programs and succinct NIZKs without PCPs
- Gennaro, Gentry, et al. - 2013
67
Universal Arguments and their Applications
- Barak, Goldreich
66
Lattice-based cryptography
- Micciancio, Regev - 2009
65
Collision-free hashing from lattice problems
- Goldreich, Goldwasser, et al. - 1996
63
Linearity testing in characteristic two
- Bellare, Coppersmith, et al. - 1995
63
Homomorphic evaluation of the AES circuit
- Gentry, Halevi, et al. - 2012
63
Pinocchio: Nearly practical verifiable computation
- Parno, Gentry, et al. - 2013
62
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Bitansky, Canetti, et al. - 2012
56
Fairplay—a secure two-party computation system
- Malkhi, Nisan, et al. - 2004
54
Homomorphic signatures for polynomial functions
- Boneh, Freeman
53
Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Bitansky, Canetti, et al. - 2013
45
Verifiable delegation of computation over large datasets
- Benabbas, Gennaro, et al. - 2011
44
A (2009) Vpriv: protecting privacy in location-based vehicular services
- Popa, Balakrishnan, et al.
42
Securely outsourcing linear algebra computations
- Atallah, Frikken - 2010
42
Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Lipmaa - 2012
42
Distributed execution with remote audit
- Monrose, Wycko, et al. - 1999
41
SCiFI – a system for secure face identification
- Osadchy, Pinkas, et al. - 2010
38
Practical verified computation with streaming interactive proofs
- Cormode, Mitzenmacher, et al. - 2012
33
SSLShader: Cheap SSL acceleration with commodity processors
- Jang, Han, et al.
32
Short PCPs with polylog query complexity
- Ben-Sasson, Sudan - 2008
31
Proof sketches: Verifiable in-network aggregation
- Garofalakis, Hellerstein, et al.
29
Memory delegation
- Chung, Kalai, et al.
29
Publicly verifiable delegation of large polynomials and matrix computations, with applications. Cryptology ePrint Archive, Report 2012/281
- Fiore, Gennaro - 2012
26
SNARKs for C: Verifying program executions succinctly and in zero knowledge
- Ben-Sasson, Chiesa, et al. - 2013
26
Improved efficient arguments (preliminary version
- Kilian - 1995
25
Efficient arguments without short PCPs
- Ishai, Kushilevitz, et al. - 2007
24
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Ben-Sasson, Chiesa, et al. - 2013
22
Proof-carrying data and hearsay arguments from signature cards
- Chiesa, Tromer - 2010
21
Toward practical and unconditional verification of remote computations
- Setty, Blumberg, et al. - 2011
19
Succinct non-interactive arguments via linear interactive proofs
- Bitansky, Chiesa, et al. - 2013
18
Verifying computations with state
- Braun, Feldman, et al. - 2013
14
Verifiable delegation of computation on outsourced data
- Backes, Fiore, et al.
14
Short PCPs verifiable in polylogarithmic time
- Ben-Sasson, Goldreich, et al.
14
Approximate checking of polynomials and functional equations
- Ergün, Kumar, et al.
14
Privacy-preserving ridge regression on hundreds of millions of records
- Nikolaenko, Weinsberg, et al. - 2013
13
Linear algebra with sub-linear zero-knowledge arguments
- Groth
12
Signatures of correct computation
- Papamanthou, Shi, et al. - 2013
11
Succinct non-interactive zero knowledge for a von Neumann architecture
- Ben-Sasson, Chiesa, et al.
11
Secure remote execution of sequential computations
- Karame, Strasser, et al.
11
Fast Fourier Transform algorithms with applications
- Mateer
10
On the concrete-efficiency threshold of probabilistically-checkable proofs
- Ben-Sasson, Chiesa, et al.
9
Bootstrapping Trust in Modern Computers
- Parno, McCune, et al. - 2011
7
Performance Application Programming Interface
- PAPI
7
Scalable zero knowledge via cycles of elliptic curves
- Ben-Sasson, Chiesa, et al.
7
Foundations of Cryptography: II Basic Applications
- Goldreich - 2004
6
TS: Faster verifiable set computations
- Kosba, Papadopoulos, et al.
4
Compiling computations to constraints for verified computation. UT Austin Honors thesis HR-12-10
- Braun - 2012
1
ChaCha, a variant of Salsa. http://cr.yp.to/chacha.html
- Bernstein
1
High-speed soware implementation of the optimal Ate pairing over Barreto-Naehrig curves. Cryptology ePrint Archive, Report
- Beuchat, Diaz, et al.
1
Seminumerical Algorithms, volume ofe Art of Computer Programming
- Knuth