Non-interactive and re-usable universally composable string commitments with adaptive security

DOI10.1007/978-3-642-25385-0_25MaRDI QIDQ3102203zbMATH OpenOpenAlexFDO

Authors Benoît Libert, Mark Manulis, Marc Fischlin

Publication date 2 December 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25385-0_25

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient non-interactive universally composable string-commitment schemes
• Non-interactive and reusable non-malleable commitment schemes
• scientific article; zbMATH DE number 1842484
• scientific article; zbMATH DE number 1952890
• Theory of Cryptography

Cited in

(17)

• Non-interactive and reusable non-malleable commitment schemes
• All-but-many encryption
• Efficient non-interactive universally composable string-commitment schemes
• Improving practical UC-secure commitments based on the DDH assumption
• Structure-preserving smooth projective hashing
• A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
• Removing erasures with explainable hash proof systems
• Theory of Cryptography
• Linearly homomorphic structure-preserving signatures and their applications
• Skipping the \(q\) in group signatures
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• UC commitments for modular protocol design and applications to revocation and attribute tokens
• Reusable online-efficient commitments
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• Constant-round adaptive zero-knowledge proofs for NP
• An algebraic framework for Diffie-Hellman assumptions
• Generic construction of UC-secure oblivious transfer

This page was built for publication: Non-interactive and re-usable universally composable string commitments with adaptive security

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