On the complexity of additively homomorphic UC commitments
From MaRDI portal
Recommendations
- Additively homomorphic UC commitments with optimal amortized overhead
- 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
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A new approach to practical active-secure two-party computation
- Actively secure OT extension with optimal overhead
- Additively homomorphic UC commitments with optimal amortized overhead
- Advances in Cryptology - CRYPTO 2003
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- All-but-many encryption. A new framework for fully-equipped UC commitments
- Analysis and improvement of Lindell's UC-secure commitment schemes
- Compact VSS and efficient homomorphic UC commitments
- Efficient non-interactive universally composable string-commitment schemes
- Extending oblivious transfer efficiently or -- how to get active security with constant cryptographic 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
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- LEGO for Two-Party Secure Computation
- MiniLEGO: efficient secure two-party computation from general assumptions
- MinT: A Database for Optimal Net Parameters
- More efficient oblivious transfer extensions with security for malicious adversaries
- Non-interactive and reusable non-malleable commitment schemes
- On the complexity of UC commitments
- OT-Combiners via Secure Computation
- Secure two-party computation via cut-and-choose oblivious transfer
- The IPS compiler: optimizations, variants and concrete efficiency
- Theory of Cryptography
- Universally composable two-party and multi-party secure computation
Cited in
(14)- All-but-many encryption
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- Efficient UC commitment extension with homomorphism for free (and applications)
- A framework for UC-secure commitments from publicly computable smooth projective hashing
- 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
- 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
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Secret Sharing Schemes with Algebraic Properties and Applications
- Non-interactive secure 2PC in the offline/online and batch settings
- Malicious secure, structure-aware private set intersection
This page was built for publication: On the complexity of additively homomorphic UC commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796142)
