The following pages link to (Q4341752):
Displaying 14 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Black-box non-interactive non-malleable commitments (Q2056786) (← links)
- On the CCA compatibility of public-key infrastructure (Q2061956) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Precise Time and Space Simulatable Zero-Knowledge (Q3092346) (← links)
- Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← links)
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing (Q3452352) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Salvaging Merkle-Damgård for Practical Applications (Q3627446) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)