Rate-1, linear time and additively homomorphic UC commitments
From MaRDI portal
Publication:2829947
DOI10.1007/978-3-662-53015-3_7zbMATH Open1406.94035OpenAlexW2493644741MaRDI QIDQ2829947FDOQ2829947
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
Recommendations
Cites Work
- Bit commitment using pseudorandomness
- Linear-time encodable and decodable error-correcting codes
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- Cryptography with constant computational overhead
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Randomness conductors and constant-degree lossless expanders
- Universally composable two-party and multi-party secure computation
- Title not available (Why is that?)
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Highly-efficient universally-composable commitments based on the DDH assumption
- How to efficiently evaluate RAM programs with malicious security
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Linear time encodable and list decodable codes
- On the complexity of additively homomorphic UC commitments
- Analysis and improvement of Lindell's UC-secure commitment schemes
- Compact VSS and efficient homomorphic UC commitments
- Additively homomorphic UC commitments with optimal amortized overhead
- On the complexity of UC commitments
- MiniLEGO: efficient secure two-party computation from general assumptions
- 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)
Uses Software
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)
