Everybody’s a Target: Scalability in Public-Key Encryption-Reference-Cited by-同舟云学术

Everybody’s a Target: Scalability in Public-Key Encryption

Published:2020 Issue: Volume: Page:475-506
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2020
language:
Short-container-title:

Author:

Auerbach Benedikt^ORCID,Giacon Federico,Kiltz Eike^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-45727-3_16

Reference30 articles.

1. Lecture Notes in Computer Science;M Abdalla,2001

2. Adrian, D., et al.: Imperfect forward secrecy: how Diffie-Hellman fails in practice. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 5–17. ACM Press, October 2015

3. Auerbach, B., Giacon, F., Kiltz, E.: Everybody’s a target: scalability in public-key encryption. Cryptology ePrint Archive, Report 2019/364 (2019). https://eprint.iacr.org/2019/364

4. Barbulescu, R.: Algorithms for discrete logarithm in finite fields. Ph.D. thesis, University of Lorraine, Nancy, France (2013)

5. Barbulescu, R., Pierrot, C.: The multiple number field sieve for medium- and high-characteristic finite fields. LMS J. Computa. Math. 17(A), 230–246 (2014)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing;Theory of Cryptography;2023

2. Multi-instance Secure Public-Key Encryption;Lecture Notes in Computer Science;2023

3. Scalable Cryptography;Lecture Notes in Computer Science;2022

4. Algebraic Adversaries in the Universal Composability Framework;Lecture Notes in Computer Science;2021

5. Tightness Subtleties for Multi-user PKE Notions;Cryptography and Coding;2021