Pages that link to "Item:Q3582754"
From MaRDI portal
The following pages link to Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography (Q3582754):
Displaying 11 items.
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens (Q2947531) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
