Publisher
Springer International Publishing
Reference44 articles.
1. Lecture Notes in Computer Science;G Barthe,2011
2. Barthe, G., Grégoire, B., Zanella Béguelin, S.: Formal certification of code-based cryptographic proofs. In: 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2009), pp. 90–101. ACM (2009)
3. Lecture Notes in Computer Science;C Baum,2018
4. Baum, C., Lyubashevsky, V.: Simple amortized proofs of shortness for linear relations over polynomial rings. IACR Cryptol. ePrint Arch. 2017, 759 (2017)
5. Lecture Notes in Computer Science;S Bayer,2012
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献