Efficient commitment schemes with bounded sender and unbounded receiver

DOI10.1007/PL00003821MaRDI QIDQ1291804zbMATH OpenFDO

Authors Shai Halevi

Publication date 22 May 2000

Published in Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

factoringcommitment schemesBlum integersclaw-free permutation pairs

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Research on commitment scheme
• Secure commitment against a powerful adversary
• scientific article; zbMATH DE number 1775398
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• scientific article; zbMATH DE number 1030983
• scientific article; zbMATH DE number 2081077
• scientific article; zbMATH DE number 1722670
• scientific article; zbMATH DE number 1304185
• scientific article; zbMATH DE number 2079923
• Efficient non-malleable commitment schemes

Cited in

(6)

• Research on commitment scheme
• Message-restriction-free commitment scheme based on lattice assumption
• Smooth projective hashing and two-message oblivious transfer
• BGN Authentication and Its Extension to Convey Message Commitments
• More efficient commitments from structured lattice assumptions
• One-round secure comparison of integers

This page was built for publication: Efficient commitment schemes with bounded sender and unbounded receiver

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