Improving practical UC-secure commitments based on the DDH assumption

DOI10.1007/978-3-319-44618-9_14MaRDI QIDQ2827723zbMATH OpenOpenAlexFDO

Authors Eiichiro Fujisaki

Publication date 21 October 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-44618-9_14

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

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

Cites work

• Additively homomorphic UC commitments with optimal amortized overhead
• Advances in cryptology - CRYPTO '98. 18th annual international cryptology conference, Santa Barbara, CA, USA, August 23--27, 1998. Proceedings
• Advances in Cryptology - CRYPTO 2003
• Advances in cryptology -- ASIACRYPT 2014. 20th international conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan, R.O.C., December 7--11, 2014. Proceedings, Part I
• All-but-many encryption. A new framework for fully-equipped UC commitments
• Analysis and improvement of Lindell's UC-secure commitment schemes
• Compact VSS and efficient homomorphic UC commitments
• Efficient noninteractive proof systems for bilinear groups
• Highly-efficient universally-composable commitments based on the DDH assumption
• scientific article; zbMATH DE number 1617925 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1302836 (Why is no real title available?)
• scientific article; zbMATH DE number 1942445 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Improving practical UC-secure commitments based on the DDH assumption
• Non-interactive and re-usable universally composable string commitments with adaptive security
• Non-interactive and reusable non-malleable commitment schemes
• On the complexity of additively homomorphic UC commitments
• On the complexity of UC commitments
• Public-key cryptography -- PKC 2015. 18th IACR international conference on practice and theory in public-key cryptography, Gaithersburg, MD, USA, March 30 -- April 1, 2015. Proceedings
• Public-key encryption indistinguishable under plaintext-checkable attacks
• Rate-1, linear time and additively homomorphic UC commitments
• Theory of Cryptography
• Theory of Cryptography
• Universally composable two-party and multi-party secure computation

Cited in

(11)

• All-but-many encryption
• A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
• DL-extractable UC-commitment schemes
• Improving practical UC-secure commitments based on the DDH assumption
• Input-aware equivocable commitments and UC-secure commitments with atomic exchanges
• Analysis and improvement of Lindell's UC-secure commitment schemes
• Compact and efficient UC commitments under atomic-exchanges
• Highly-efficient universally-composable commitments based on the DDH assumption
• Fast secure two-party ECDSA signing
• Fast two-party signature for upgrading ECDSA to two-party scenario easily
• Simple three-round multiparty Schnorr signing with full simulatability

This page was built for publication: Improving practical UC-secure commitments based on the DDH assumption

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