On the Complexity of Additively Homomorphic UC Commitments

DOI10.1007/978-3-662-49096-9_23zbMath1388.94055OpenAlexW2294400283MaRDI QIDQ2796142

Jesper Buus Nielsen, Roberto Trifiletti, Thomas Pelle Jakobsen, Tore Kasper Frederiksen

Publication date: 23 March 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_23

zbMATH Keywords

erasure codescommitmentsminimal assumptionshomomorphiclinear error correcting codesUC

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ Malicious secure, structure-aware private set intersection ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ All-but-many encryption ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments ⋮ UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings

Uses Software

• MinT
• MiniLEGO
• TinyLEGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
• A New Approach to Practical Active-Secure Two-Party Computation
• Compact VSS and Efficient Homomorphic UC Commitments
• All-But-Many Encryption
• Additively Homomorphic UC Commitments with Optimal Amortized Overhead
• Extending Oblivious Transfer Efficiently
• More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
• How to Efficiently Evaluate RAM Programs with Malicious Security
• Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• Actively Secure OT Extension with Optimal Overhead
• Universally composable two-party and multi-party secure computation
• Non-interactive and reusable non-malleable commitment schemes
• A Framework for Efficient and Composable Oblivious Transfer
• Founding Cryptography on Oblivious Transfer – Efficiently
• LEGO for Two-Party Secure Computation
• Efficient Non-interactive Universally Composable String-Commitment Schemes
• MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
• The IPS Compiler: Optimizations, Variants and Concrete Efficiency
• On the Complexity of UC Commitments
• Advances in Cryptology - CRYPTO 2003
• OT-Combiners via Secure Computation
• MinT: A Database for Optimal Net Parameters
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Theory of Cryptography

This page was built for publication: On the Complexity of Additively Homomorphic UC Commitments