Compact VSS and efficient homomorphic UC commitments
From MaRDI portal
Publication:2936610
DOI10.1007/978-3-662-45608-8_12zbMATH Open1317.94101OpenAlexW100837511MaRDI QIDQ2936610FDOQ2936610
Irene Giacomelli, Ivan B. Damgård, Jesper Buus Nielsen, Bernardo David
Publication date: 6 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_12
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)
- Rate-1, linear time and additively homomorphic UC commitments
- Computational verifiable secret sharing revisited
Cited In (12)
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- All-but-many encryption
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
- Asymptotically free broadcast in constant expected time via packed VSS
- On the Complexity of Additively Homomorphic UC Commitments
- Improving Practical UC-Secure Commitments Based on the DDH Assumption
- Rate-1, Linear Time and Additively Homomorphic UC Commitments
- Title not available (Why is that?)
- A framework for UC-secure commitments from publicly computable smooth projective hashing
- DL-extractable UC-commitment schemes
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)
- Secret Sharing Schemes with Algebraic Properties and Applications
This page was built for publication: Compact VSS and efficient homomorphic UC commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936610)
