Dynamic universal accumulator with batch update over bilinear groups
From MaRDI portal
Publication:2152172
DOI10.1007/978-3-030-95312-6_17zbMath1492.94167OpenAlexW3037664655MaRDI QIDQ2152172
Publication date: 6 July 2022
Full work available at URL: https://eprint.iacr.org/2020/777
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptanalysis of a dynamic universal accumulator over bilinear groups
- Pairings for cryptographers
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Short signatures without random oracles and the SDH assumption in bilinear groups
- 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
- On the Impossibility of Batch Update for Cryptographic Accumulators
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Implementing Pairings at the 192-Bit Security Level
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Oblivious Polynomial Evaluation
- Topics in Cryptology – CT-RSA 2005
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
