Statistical secrecy and multibit commitments

DOI10.1109/18.669255zbMath0906.94016OpenAlexW2127072370MaRDI QIDQ4400331

Birgit Pfitzmann, Torben P. Pedersen, 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

zbMATH Keywords

unconditional securitycryptologyprotocolszero-knowledgeShannon theorymultibit commitmentsimilarity of ensembles of distributionsstatistically hiding

Mathematics Subject Classification ID

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

Related Items (8)

Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions ⋮ On the existence of statistically hiding bit commitment schemes and fail-stop signatures ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ 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) ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

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