On the Equality of Probabilistic Terms-Reference-Cited by-同舟云学术

On the Equality of Probabilistic Terms

Published:2010 Issue: Volume: Page:46-63
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Barthe Gilles,Daubignard Marion,Kapron Bruce,Lakhnech Yassine,Laporte Vincent

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17511-4_4

Reference15 articles.

1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

2. Barthe, G., Grégoire, B., Béguelin, S.Z.: Formal certification of code-based cryptographic proofs. In: Proceedings of POPL 2009, pp. 90–101. ACM Press, New York (2009)

3. Baudet, M., Cortier, V., Kremer, S.: Computationally sound implementations of equational theories against passive adversaries. Inf. Comput. 207(4), 496–520 (2009)

4. Lecture Notes in Computer Science;M. Bellare,2006

5. Lecture Notes in Computer Science;M. Bellare,1995

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

1. Linicrypt in the Ideal Cipher Model;Provable and Practical Security;2023

2. Universal Equivalence and Majority of Probabilistic Programs over Finite Fields;ACM Transactions on Computational Logic;2022-01-31

3. Decidability of a Sound Set of Inference Rules for Computational Indistinguishability;ACM Transactions on Computational Logic;2021-01-31

4. Universal equivalence and majority of probabilistic programs over finite fields;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

5. Symbolic Methods in Computational Cryptography Proofs;2019 IEEE 32nd Computer Security Foundations Symposium (CSF);2019-06