Combiners for Backdoored Random Oracles-Reference-Cited by-同舟云学术

Combiners for Backdoored Random Oracles

Published:2018 Issue: Volume: Page:272-302
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bauer Balthazar,Farshim Pooya,Mazaheri Sogol

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-96881-0_10

Reference38 articles.

1. Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory (preliminary version). In: 27th FOCS, pp. 337–347 (1986)

2. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. In: 43rd FOCS, pp. 209–218 (2002)

3. Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: 42nd ACM STOC, pp. 67–76 (2010)

4. Bauer, B., Farshim, P., Mazaheri, S.: Combiners for backdoored random oracles. Cryptology ePrint Archive (2018)

5. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM CCS 1993, pp. 62–73 (1993)

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

1. Communication Lower Bounds for Collision Problems via Density Increment Arguments;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Immunizing Backdoored PRGs;Theory of Cryptography;2023

3. Subversion-Resilient Authenticated Encryption Without Random Oracles;Applied Cryptography and Network Security;2023

4. Algorithm substitution attacks against receivers;International Journal of Information Security;2022-06-21

5. Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity;Theory of Cryptography;2020