UC commitments for modular protocol design and applications to revocation and attribute tokens
From MaRDI portal
Publication:2829948
Recommendations
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- scientific article; zbMATH DE number 1842484
- Efficient non-interactive universally composable string-commitment schemes
- On the complexity of UC commitments
- Non-interactive and re-usable universally composable string commitments with adaptive security
Cites work
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (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?)
- Advances in Cryptology - EUROCRYPT 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- Formal treatment of privacy-enhancing credential systems
- Highly-efficient universally-composable commitments based on the DDH assumption
- Information Security
- On the complexity of additively homomorphic UC commitments
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Solving revocation with efficient update of anonymous credentials
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Universally composable two-party and multi-party secure computation
- Vector commitments and their applications
Cited in
(3)
This page was built for publication: UC commitments for modular protocol design and applications to revocation and attribute tokens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829948)
