Rate-1, Linear Time and Additively Homomorphic UC Commitments
From MaRDI portal
Publication:2829947
DOI10.1007/978-3-662-53015-3_7zbMath1406.94035OpenAlexW2493644741MaRDI QIDQ2829947
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
Related Items (6)
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 ⋮ All-but-many encryption ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- On the Complexity of Additively Homomorphic UC Commitments
- Very-Efficient Simulatable Flipping of Many Coins into a Well
- 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
- How to Efficiently Evaluate RAM Programs with Malicious Security
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
- Linear-time encodable and decodable error-correcting codes
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Universally composable two-party and multi-party secure computation
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Randomness conductors and constant-degree lossless expanders
- Linear time encodable and list decodable codes
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- On the Complexity of UC Commitments
This page was built for publication: Rate-1, Linear Time and Additively Homomorphic UC Commitments
