scientific article; zbMATH DE number 1024061

zbMath0873.94017MaRDI QIDQ4341752

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

Publication date: 2 November 1997

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

zbMATH Keywords

fail-stop signaturescollision-intractable hash functionstatistically hiding bit commitment scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Concurrent knowledge extraction in public-key models ⋮ Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Possibility and impossibility results for selective decommitments ⋮ Efficient non-malleable commitment schemes ⋮ Efficient non-malleable commitment schemes ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ On the power of secure two-party computation ⋮ Black-box non-interactive non-malleable commitments ⋮ Precise Time and Space Simulatable Zero-Knowledge ⋮ On the CCA compatibility of public-key infrastructure ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries