Generalised Asynchronous Remote Key Generation for Pairing-Based Cryptosystems

[1]  M. Manulis,et al.  Asynchronous Remote Key Generation for Post-Quantum Cryptosystems from Lattices , 2023, 2023 IEEE 8th European Symposium on Security and Privacy (EuroS&P).

[2]  Nick Frymann,et al.  Asynchronous Remote Key Generation: An Analysis of Yubico's Proposal for W3C WebAuthn , 2020, IACR Cryptol. ePrint Arch..

[3]  Georg Fuchsbauer,et al.  A Classification of Computational Assumptions in the Algebraic Group Model , 2020, IACR Cryptol. ePrint Arch..

[4]  Marc Fischlin,et al.  PRF-ODH: Relations, Instantiations, and Impossibility Results , 2017, CRYPTO.

[5]  David Pointcheval,et al.  Short Randomizable Signatures , 2016, CT-RSA.

[6]  Christian Hanser,et al.  Structure-Preserving Signatures on Equivalence Classes and their Application to Anonymous Credentials , 2014, IACR Cryptol. ePrint Arch..

[7]  Sanjit Chatterjee,et al.  Comparing two pairing-based aggregate signature schemes , 2010, Des. Codes Cryptogr..

[8]  Xavier Boyen,et al.  The Uber-Assumption Family , 2008, Pairing.

[9]  Brent Waters.  Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.

[10]  Jan Camenisch,et al.  Signature Schemes and Anonymous Credentials from Bilinear Maps , 2004, CRYPTO.

[11]  D. Boneh,et al.  Short Signatures from the Weil Pairing , 2001, Journal of Cryptology.

[12]  Amit Sahai,et al.  Pseudonym Systems , 1999, Selected Areas in Cryptography.

[13]  Lior Rotem.  Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups , 2022, IACR Cryptol. ePrint Arch..

[14]  M. Manulis,et al.  Unlinkable Delegation of WebAuthn Credentials , 2022, IACR Cryptol. ePrint Arch..