![[ICO]](/icons/blank.gif) | Name | Last modified | Size | Description |
|---|
|
|---|
![[PARENTDIR]](/icons/back.gif) | Parent Directory | | - | |
![[DIR]](/icons/folder.gif) | range proofs/ | 2023-08-25 22:25 | - | |
| zkSNARKs/ | 2023-08-25 22:25 | - | |
![[ ]](/icons/layout.gif) | Proof Systems for General Statements about Discrete Logarithms (1997) - Camenisch, Stadler.pdf | 2023-08-25 22:25 | 5.4K | |
| Zero-Knowledge Proofs (2016) [lecture] - Miller.pdf | 2023-08-25 22:25 | 128K | |
| A Note on the Unsoundness of vnTinyRAM's SNARK (2015) - Parno.pdf | 2023-08-25 22:25 | 162K | |
| On Diophantine Complexity and Statistical Zero-Knowledge Arguments (2003) - Lipmaa.pdf | 2023-08-25 22:25 | 272K | |
| A Machine-Checked Formalization of Sigma-Protocols (2010) - Barthe, Hedin, Béguelin, Grégoire, Heraud.pdf | 2023-08-25 22:25 | 281K | |
| Proof-of-Knowledge of Representation of Committed Value and Its Application (2010) - Au, Susilo, Mu.pdf | 2023-08-25 22:25 | 293K | |
| Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists (2015) - Bayer, Groth.pdf | 2023-08-25 22:25 | 297K | |
| On the Size of Pairing-Based Non-Interactive Arguments (2016) - Groth.pdf | 2023-08-25 22:25 | 395K | |
| Quadratic Span Programs and Succinct NIZKs without PCPs (2014) - Gennaro, Gentry, Parno, Raykova.pdf | 2023-08-25 22:25 | 413K | |
| Faster Two-Party Computation Using Garbled Circuits (2013) - Huang, Evans, Katz, Malka.pdf | 2023-08-25 22:25 | 415K | |
| One-out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin (2014) - Groth, Kohlweiss.pdf | 2023-08-25 22:25 | 420K | |
| Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017) - Chase, Derler, Goldfeder, Orlandi, Ramacher, Rechberger, Slamanig, Zavuchera.pdf | 2023-08-25 22:25 | 430K | |
| ZKBoo: Faster Zero-Knowledge for Boolean Circuits (2016) - Giacomelli, Madsen, Orlandi.pdf | 2023-08-25 22:25 | 488K | |
| How to Garble Arithmetic Circuits (2012) - Appelbaum, Ishai, Kushilevitz.pdf | 2023-08-25 22:25 | 490K | |
| The History of the PCP Theorem (2005) - O'Donnell.pdf | 2023-08-25 22:25 | 585K | |
| On the Portability of Generalized Schnorr Proofs (2009) - Camenisch, Lysyanskaya.pdf | 2023-08-25 22:25 | 610K | |
| A Framework for Practical Universally Composable Zero-Knowledge Protocols (2011) - Camenisch, Krenn, Shoup.pdf | 2023-08-25 22:25 | 627K | |
| ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash (2010) - Lysyanskaya et. al.pdf | 2023-08-25 22:25 | 678K | |
| Zero-Knowledge Using Garbled Circuits: or How To Prove Non-Algebraic Statements Efficiently (2013) - Jawurek, Kerschbaum, Orlandi.pdf | 2023-08-25 22:25 | 713K | |
| Trading Group Theory for Randomness (1985) - Babai.pdf | 2023-08-25 22:25 | 891K | |
| Everything Provable is Provable in Zero-Knowledge (1988) - Ben-Or, Goldreich, Goldwasser, Håstad, Kilian, Micali, Rogaway.pdf | 2023-08-25 22:25 | 1.1M | |
| Zero-Knowledge Proofs of Identity (1988) - Feige, Fiat, Shamir.pdf | 2023-08-25 22:25 | 1.3M | |
| Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture (2014) - Ben-Sasson, Chiesa, Tromer, Virza.pdf | 2023-08-25 22:25 | 1.4M | |
| On the Concrete Efficiency of Probabilistically-Checkable Proofs (2012) - Ben-Sasson, Chiesa, Genkin, Tromer.pdf | 2023-08-25 22:25 | 1.6M | |
| Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (1991) - Goldreich, Micali, Wigderson.pdf | 2023-08-25 22:25 | 1.7M | |
| Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems (2012) - Ben-Sasson, Chiesa, Genkin, Tromer.pdf | 2023-08-25 22:25 | 2.3M | |
| Blind, Auditable Membership Proofs (2000) - Sander, Ta-Shma, Yung.pdf | 2023-08-25 22:25 | 3.7M | |
| Cluster Computing in Zero Knowledge (2015) - Cheisa, Tromer, Virza.pdf | 2023-08-25 22:25 | 4.8M | |
| Efficient Identification and Signatures for Smart Cards (1989) - Schnorr.pdf | 2023-08-25 22:25 | 5.3M | |
| A Graduate Course in Applied Cryptography (2017) [v0.4] - Boneh, Shoup.pdf | 2023-08-25 22:25 | 25M | |
|
|---|