The following pages link to (Q3549591):
Displaying 17 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- A new interactive hashing theorem (Q2442643) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- (Q4341752) (← links)
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment (Q5041225) (← links)
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way (Q5445518) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- That's not my signature! Fail-stop signatures for a post-quantum world (Q6648190) (← links)
