Super-Linear Time-Memory Trade-Offs for Symmetric Encryption-Reference-Cited by-同舟云学术

Super-Linear Time-Memory Trade-Offs for Symmetric Encryption

Published:2020 Issue: Volume: Page:335-365
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Dai Wei,Tessaro Stefano,Zhang Xihu

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-64381-2_12

Reference48 articles.

1. Agrawal, R.: Samplers and extractors for unbounded functions. In: Achlioptas, D., Végh, L.A. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), volume 145 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 59:1–59:21, Dagstuhl, Germany (2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik

2. Lecture Notes in Computer Science;B Auerbach,2017

3. Lecture Notes in Computer Science;Y Aumann,1999

4. Lecture Notes in Computer Science;B Barak,2011

5. Beame, P., Gharan, S.O., Yang, X.: Time-space tradeoffs for learning finite functions from random evaluations, with applications to polynomials. In: Bubeck, S., Perchet, V., Rigollet, P. (eds.) Conference On Learning Theory, COLT 2018, volume 75 of Proceedings of Machine Learning Research, Stockholm, Sweden, 6–9 July 2018, pp. 843–856. PMLR (2018)

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

1. On Differential Privacy and Adaptive Data Analysis with Bounded Space;Advances in Cryptology – EUROCRYPT 2023;2023

2. Memory-Tight Multi-challenge Security of Public-Key Encryption;Advances in Cryptology – ASIACRYPT 2022;2022

3. Hiding in Plain Sight: Memory-Tight Proofs via Randomness Programming;Advances in Cryptology – EUROCRYPT 2022;2022