Dynamic universal accumulator with batch update over bilinear groups
From MaRDI portal
Publication:2152172
Recommendations
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- A New Dynamic Accumulator for Batch Updates
- scientific article; zbMATH DE number 1942413
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Bivariate polynomials modulo composites and their applications
- Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
- Cryptanalysis of a dynamic universal accumulator over bilinear groups
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Efficient Non-interactive Proof Systems for Bilinear Groups
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 2081076 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- scientific article; zbMATH DE number 1424194 (Why is no real title available?)
- Implementing pairings at the 192-bit security level
- Oblivious Polynomial Evaluation
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- On the impossibility of batch update for cryptographic accumulators
- Pairings for cryptographers
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Topics in Cryptology – CT-RSA 2005
- Universal Accumulators with Efficient Nonmembership Proofs
Cited in
(8)- Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- On the impossibility of batch update for cryptographic accumulators
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- A New Dynamic Accumulator for Batch Updates
- Fully dynamic group signatures from subset difference methods under simple assumptions
- Universally composable accumulators
- Cryptanalysis of a dynamic universal accumulator over bilinear groups
This page was built for publication: Dynamic universal accumulator with batch update over bilinear groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152172)
