Additively homomorphic UC commitments with optimal amortized overhead

DOI10.1007/978-3-662-46447-2_22MaRDI QIDQ2941207zbMATH OpenOpenAlexFDO

Authors Ignacio Cascudo, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti, Ivan B. Damgård

Publication date 27 August 2015

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

Full work available at URL https://doi.org/10.1007/978-3-662-46447-2_22

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the complexity of additively homomorphic UC commitments
• Rate-1, linear time and additively homomorphic UC commitments
• Efficient UC commitment extension with homomorphism for free (and applications)
• Compact VSS and efficient homomorphic UC commitments
• On the complexity of UC commitments

Cited in

(14)

• All-but-many encryption
• A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
• Threshold Schnorr with stateless deterministic signing from standard assumptions
• Efficient UC commitment extension with homomorphism for free (and applications)
• On the power of secure two-party computation
• On the complexity of additively homomorphic UC commitments
• Improving practical UC-secure commitments based on the DDH assumption
• On the Power of Secure Two-Party Computation
• Rate-1, linear time and additively homomorphic UC commitments
• Compact VSS and efficient homomorphic UC commitments
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• Secret Sharing Schemes with Algebraic Properties and Applications
• Non-interactive secure 2PC in the offline/online and batch settings
• Reusable online-efficient commitments

This page was built for publication: Additively homomorphic UC commitments with optimal amortized overhead

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