DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Charles Rackoff
Charles Rackoff
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs*
Oacerts: Oblivious Attribute Certificates
Simple Doubly-Efficient Interactive Proof Systems for Locally
A Zero Knowledge Sumcheck and Its Applications
Zero Knowledge and Soundness Are Symmetric∗
Pseudorandomness and Combinatorial Constructions
Atom: Horizontally Scaling Strong Anonymity
DRAFT -- DRAFT -- Appendix
Learning to Impersonate
Algorithmic Incentives: New Twist on 30 Year- Old Work Could Lead to Better Ways of Structuring Contracts 25 April 2012, by Larry Hardesty
Advances and Open Problems in Federated Learning
Some Estimated Likelihoods for Computational Complexity
Lecture 3: Interactive Proofs and Zero-Knowledge Instructors: Henry Corrigan-Gibbs, Sam Kim, David J
Symmetric Cryptography
A Tutorial on Concurrent Zero Knowledge∗
The Curious Case of Non-Interactive Commitments — on the Power of Black-Box Vs
Simple Doubly-Efficient Interactive Proof Systems for Locally
Proof Beyond a Reasonable Doubt
Top View
The Moral Character of Cryptographic Work⋆
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
Zero Knowledge Proofs
Simultaneous Resettability from One-Way Functions
Scramble All, Encrypt Small
Interactive Proof System We Have Seen Interactive Proofs, in Various Disguised Forms, in the Definitions of NP, OTM, Cook Reduction and PH
Deterministic Approximation of Random Walks in Small Space
Zero Knowledge and Soundness Are Symmetric∗
Optimal Hitting Sets for Combinatorial Shapes
Introductory Lecture 1 What This Course Is About
Separating Succinct Non-Interactive Arguments from All Falsifiable
Deterministic Approximation of Random Walks in Small Space
Practical Chosen Ciphertext Secure Encryption from Factoring
3-Round Feistel Is Not Superpseudorandom Over Any Group
Quantum Interactive Proofs and Semidefinite Programming
On the Limitations of the Spread of an IBE-To-PKE Transformation
Lecture Notes in Computer Science for Information About Vols
Cryptography