The following pages link to (Q5750398):
Displaying 32 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. (Q398324) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- Relativized perfect zero knowledge is not BPP (Q811120) (← links)
- A convertible multi-authenticated encryption scheme for group communications (Q942321) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) (← links)
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816) (← links)
- Quantum Commitments from Complexity Assumptions (Q3012793) (← links)
- Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- On Emulating Interactive Proofs with Public Coins (Q5098777) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge (Q5868888) (← links)