Dynamic universal accumulator with batch update over bilinear groups
From MaRDI portal
Publication:2152172
DOI10.1007/978-3-030-95312-6_17zbMATH Open1492.94167OpenAlexW3037664655MaRDI QIDQ2152172FDOQ2152172
Publication date: 6 July 2022
Full work available at URL: https://eprint.iacr.org/2020/777
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
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Implementing Pairings at the 192-Bit Security Level
- Pairings for cryptographers
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma
- Oblivious Polynomial Evaluation
- Title not available (Why is that?)
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Bivariate Polynomials Modulo Composites and Their Applications
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Cryptanalysis of a dynamic universal accumulator over bilinear groups
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
- Title not available (Why is that?)
- On the Impossibility of Batch Update for Cryptographic Accumulators
Cited In (1)
Uses Software
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)
