Author:
Bogos Sonia,Korolija Dario,Locher Thomas,Vaudenay Serge
Publisher
Springer International Publishing
Reference32 articles.
1. Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings 44th Symposium on Foundations of Computer Science (FOCS), pp. 298–307 (2003)
2. Lecture Notes in Computer Science;B Applebaum,2009
3. Lecture Notes in Computer Science;A Blum,1994
4. Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: Proceedings 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 435–440 (2000)
5. Bogos, S., Vaudenay, S.: Optimization of LPN solving algorithms. In: Proceedings 22nd International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), pp. 703–728 (2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Attacks on the Firekite Cipher;IACR Transactions on Symmetric Cryptology;2022-09-09