Compact VSS and efficient homomorphic UC commitments
From MaRDI portal
Publication:2936610
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
(16)- Updatable privacy-preserving blueprints
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- All-but-many encryption
- Non-interactive Distributed-Verifier Proofs and Proving Relations among 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
- Rate-1, linear time and additively homomorphic UC commitments
- Asymptotically free broadcast in constant expected time via packed VSS
- scientific article; zbMATH DE number 1982619 (Why is no real title available?)
- A framework for UC-secure commitments from publicly computable smooth projective hashing
- Asymptotically free broadcast in constant expected time via packed VSS
- Efficient UC commitment extension with homomorphism for free (and applications)
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- DL-extractable UC-commitment schemes
- 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)