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
Authors: Giuseppe Vitto, Alex Biryukov 
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 (7)
- Cryptanalysis of a dynamic universal accumulator over bilinear groups
- A New Dynamic Accumulator for Batch Updates
- 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
- Universally composable accumulators
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
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)
