The following pages link to Theory of Cryptography (Q5901768):
Displaying 17 items.
- Cryptography in the multi-string model (Q744350) (← links)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- On the one-per-message unforgeability of (EC)DSA and its variants (Q1690283) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Verifiable functional encryption using Intel SGX (Q2697922) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- One message proof systems with known space verifiers (Q4341735) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier (Q5204303) (← links)
- Adaptive security in SNARGs via iO and lossy functions (Q6660293) (← links)
- NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness (Q6660376) (← links)
