Author:
Barthe Gilles,Grégoire Benjamin,Lakhnech Yassine,Zanella Béguelin Santiago
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Lecture Notes in Computer Science;R. Affeldt,2007
2. Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in Coq. Sci. Comput. Program. 74(8), 568–589 (2009)
3. Lecture Notes in Artificial Intelligence;M. Backes,2008
4. Lecture Notes in Computer Science;M. Backes,2008
5. Barthe, G., Daubignard, M., Kapron, B., Lakhnech, Y.: Computational indistinguishability logic. In: 17th ACM Conference on Computer and Communications Security, CCS 2010. ACM, New York (2010)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Machine-Checked Security for $$\textrm{XMSS} $$ as in RFC 8391 and $$\mathrm {SPHINCS^{+}} $$;Advances in Cryptology – CRYPTO 2023;2023
2. Designing a Provenance Analysis for SGX Enclaves;Proceedings of the 38th Annual Computer Security Applications Conference;2022-12-05
3. A Novel Proof of Shuffle: Exponentially Secure Cut-and-Choose;Information Security and Privacy;2021
4. Fast Cramer-Shoup Cryptosystem;Proceedings of the 18th International Conference on Security and Cryptography;2021
5. Fake Near Collisions Attacks;IACR Transactions on Symmetric Cryptology;2020-12-10