Rate-1, linear time and additively homomorphic UC commitments

DOI10.1007/978-3-662-53015-3_7MaRDI QIDQ2829947zbMATH OpenOpenAlexFDO

Authors Ignacio Cascudo, Bernardo David, Nico Döttling, Jesper Buus Nielsen, Ivan B. Damgård

Publication date 9 November 2016

Published in Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53015-3_7

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the complexity of additively homomorphic UC commitments
• Additively homomorphic UC commitments with optimal amortized overhead
• Efficient UC commitment extension with homomorphism for free (and applications)
• Compact VSS and efficient homomorphic UC commitments
• On the complexity of UC commitments

Cites work

• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• Additively homomorphic UC commitments with optimal amortized overhead
• Analysis and improvement of Lindell's UC-secure commitment schemes
• Bit commitment using pseudorandomness
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Compact VSS and efficient homomorphic UC commitments
• Cryptography with constant computational overhead
• Founding Cryptography on Oblivious Transfer – Efficiently
• Highly-efficient universally-composable commitments based on the DDH assumption
• How to efficiently evaluate RAM programs with malicious security
• Linear time encodable and list decodable codes
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• Linear-time encodable and decodable error-correcting codes
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• MiniLEGO: efficient secure two-party computation from general assumptions
• Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
• On the complexity of UC commitments
• On the complexity of additively homomorphic UC commitments
• Randomness conductors and constant-degree lossless expanders
• Secure Arithmetic Computation with No Honest Majority
• Universally composable two-party and multi-party secure computation
• Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)

Cited in

(11)

• All-but-many encryption
• Compact VSS and efficient homomorphic UC commitments
• Additively homomorphic UC commitments with optimal amortized overhead
• On the complexity of additively homomorphic UC commitments
• Improving practical UC-secure commitments based on the DDH assumption
• A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
• The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
• SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
• Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
• Low cost constant round MPC combining BMR and oblivious transfer
• Efficient UC commitment extension with homomorphism for free (and applications)

Describes a project that uses

Uses Software

• MiniLEGO

This page was built for publication: Rate-1, linear time and additively homomorphic UC commitments

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