scientific article
From MaRDI portal
Publication:3549591
zbMath1232.68043MaRDI QIDQ3549591
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Concurrent knowledge extraction in public-key models ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Long-term security and universal composability ⋮ Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP ⋮ From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments ⋮ Possibility and impossibility results for selective decommitments ⋮ A new interactive hashing theorem ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Semi-honest to Malicious Oblivious Transfer—The Black-Box Way ⋮ An Equivalence Between Zero Knowledge and Commitments ⋮ The Complexity of Zero Knowledge ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication:
