The Distinction Between Fixed and Random Generators in Group-Based Assumptions-Reference-Cited by-同舟云学术

The Distinction Between Fixed and Random Generators in Group-Based Assumptions

Published:2019 Issue: Volume: Page:801-830
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2019
language:
Short-container-title:

Author:

Bartusek James,Ma Fermi,Zhandry Mark

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-26951-7_27

Reference45 articles.

1. Lecture Notes in Computer Science;B Barak,2001

2. Lecture Notes in Computer Science;G Barthe,2014

3. Bartusek, J., Ma, F., Zhandry, M.: The distinction between fixed and random generators in group-based assumptions. Cryptology ePrint Archive, Report 2019/202 (2019). https://eprint.iacr.org/2019/202

4. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 1993, pp. 62–73. ACM Press, November 1993

5. Lecture Notes in Computer Science;DJ Bernstein,2013

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

1. Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Non-malleable Fuzzy Extractors;Lecture Notes in Computer Science;2024

3. A Public Key Identity-Based Revocation Scheme:;Lecture Notes in Computer Science;2024

4. A Simpler and More Efficient Reduction of DLog to CDH for Abelian Group Actions;Lecture Notes in Computer Science;2024

5. Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions;Lecture Notes in Computer Science;2024