Improving Practical UC-Secure Commitments Based on the DDH Assumption

DOI10.1007/978-3-319-44618-9_14zbMath1416.94049OpenAlexW2508520219MaRDI QIDQ2827723

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

Cryptography (94A60) Network protocols (68M12)

Related Items

Fast two-party signature for upgrading ECDSA to two-party scenario easily, All-but-many encryption, A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions, Fast secure two-party ECDSA signing, Improving Practical UC-Secure Commitments Based on the DDH Assumption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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
• Advances in cryptology - CRYPTO '98. 18th annual international cryptology conference, Santa Barbara, CA, USA, August 23--27, 1998. Proceedings
• On the Complexity of Additively Homomorphic UC Commitments
• Improving Practical UC-Secure Commitments Based on the DDH Assumption
• Rate-1, Linear Time and Additively Homomorphic UC Commitments
• Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
• Compact VSS and Efficient Homomorphic UC Commitments
• All-But-Many Encryption
• Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks
• Additively Homomorphic UC Commitments with Optimal Amortized Overhead
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
• Universally composable two-party and multi-party secure computation
• Non-interactive and reusable non-malleable commitment schemes
• Efficient Noninteractive Proof Systems for Bilinear Groups
• On the Complexity of UC Commitments
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Theory of Cryptography