Statistical secrecy and multibit commitments

DOI10.1109/18.669255zbMATH Open0906.94016OpenAlexW2127072370MaRDI QIDQ4400331FDOQ4400331

Authors: Torben P. Pedersen, Birgit Pfitzmann, Ivan B. Damgård 

Publication date: 2 August 1998

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.2273

Recommendations

• Statistically-hiding commitment from any one-way function
• Reducing complexity assumptions for statistically-hiding commitment
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• scientific article; zbMATH DE number 1024061
• Reducing Complexity Assumptions for Statistically-Hiding Commitment

zbMATH Keywords

unconditional securitycryptologyprotocolszero-knowledgeShannon theorymultibit commitmentsimilarity of ensembles of distributionsstatistically hiding

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Cryptography (94A60)

Cited In (17)

• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Title not available (Why is that?)
• On statistical security in two-party computation
• Constant-round leakage-resilient zero-knowledge from collision resistance
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• Title not available (Why is that?)
• Inaccessible entropy
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
• Somewhere statistically binding commitment schemes with applications
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
• Secret Sharing and Statistical Zero Knowledge

This page was built for publication: Statistical secrecy and multibit commitments

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