scientific article; zbMATH DE number 2079922

zbMath1048.94505MaRDI QIDQ4472067

Marc Fischlin

Publication date: 3 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2271/22710079.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment ⋮ On the Power of Statistical Zero Knowledge ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Bounds on the efficiency of black-box commitment schemes ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: