Compact and efficient UC commitments under atomic-exchanges

DOI10.1007/978-3-319-15943-0_23MaRDI QIDQ2942848zbMATH OpenOpenAlexFDO

Authors Ioana Boureanu, Serge Vaudenay

Publication date 11 September 2015

Published in Information Security and Cryptology - ICISC 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15943-0_23

zbMATH Keywords

commitmentuniversal composability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Highly-efficient universally-composable commitments based on the DDH assumption
• Improving practical UC-secure commitments based on the DDH assumption
• On the complexity of UC commitments
• Analysis and improvement of Lindell's UC-secure commitment schemes
• scientific article; zbMATH DE number 1842484

Cites work

• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 503249 (Why is no real title available?)
• scientific article; zbMATH DE number 1942445 (Why is no real title available?)
• scientific article; zbMATH DE number 1394315 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• Analysis and improvement of Lindell's UC-secure commitment schemes
• Highly-efficient universally-composable commitments based on the DDH assumption
• Input-aware equivocable commitments and UC-secure commitments with atomic exchanges
• Isolated Proofs of Knowledge and Isolated Zero Knowledge
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Theory of Cryptography
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally Composable Multiparty Computation with Partially Isolated Parties
• Universally Composable Security with Global Setup
• Universally composable two-party and multi-party secure computation

Cited in

(7)

• More efficient commitments from structured lattice assumptions
• Analysis and improvement of Lindell's UC-secure commitment schemes
• Improving practical UC-secure commitments based on the DDH assumption
• On the complexity of UC commitments
• Input-aware equivocable commitments and UC-secure commitments with atomic exchanges
• DL-extractable UC-commitment schemes
• Highly-efficient universally-composable commitments based on the DDH assumption

This page was built for publication: Compact and efficient UC commitments under atomic-exchanges

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