scientific article; zbMATH DE number 2079922

zbMATH Open1048.94505MaRDI QIDQ4472067FDOQ4472067

Authors: 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 of this publication is not available (Why is that?)

Recommendations

• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• Publication:5750403
• The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
• Statistically-hiding commitment from any one-way function
• Non-malleable statistically hiding commitment from any one-way function

Mathematics Subject Classification ID

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

Cited In (11)

• On the power of statistical zero knowledge
• A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
• Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
• Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
• Hybrid commitments and their applications to zero-knowledge proof systems
• On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
• Bounds on the efficiency of black-box commitment schemes
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Title not available (Why is that?)
• Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472067)