Author:
Bogos Sonia,Vaudenay Serge
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 11–14 October 2003, pp. 298–307. IEEE Computer Society, Cambridge (2003)
2. Lecture Notes in Computer Science;G Avoine,2015
3. Lecture Notes in Computer Science;G Avoine,2014
4. Lecture Notes in Computer Science;G Avoine,2005
5. Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: Frances Yao, F., Luks, E.M. (eds.) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 21–23 May 2000, pp. 435–440. ACM (2000)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Attacks on the Firekite Cipher;IACR Transactions on Symmetric Cryptology;2022-09-09
2. Optimization of $$\mathsf {LPN}$$ Solving Algorithms;Advances in Cryptology – ASIACRYPT 2016;2016