Generalised asynchronous remote key generation for pairing-based cryptosystems
From MaRDI portal
Recommendations
Cites work
- A classification of computational assumptions in the algebraic group model
- Advances in Cryptology – CRYPTO 2004
- Comparing two pairing-based aggregate signature schemes
- Efficient Identity-Based Encryption Without Random Oracles
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1440890 (Why is no real title available?)
- PRF-ODH: relations, instantiations, and impossibility results
- Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups
- Short randomizable signatures
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- The Uber-Assumption Family
This page was built for publication: Generalised asynchronous remote key generation for pairing-based cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535085)