( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption.

, , и . CSFW, стр. 170-184. IEEE Computer Society, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Bana Schbani

Bana Schbani

Bana Schbani

Bana Bihari Mazumdar

Manfred Viktor Banaschik

 

Другие публикации лиц с тем же именем

A Computationally Complete Symbolic Attacker for Equivalence Properties., и . ACM Conference on Computer and Communications Security, стр. 609-620. ACM, (2014)Time, Privacy, Robustness, Accuracy: Trade-Offs for the Open Vote Network Protocol., , , , , , , , и . E-Vote-ID, том 13553 из Lecture Notes in Computer Science, стр. 19-35. Springer, (2022)A Semantics for "Typically" in First-Order Default Reasoning., и . JSAI-isAI Workshops, том 12758 из Lecture Notes in Computer Science, стр. 3-20. Springer, (2020)Computational and Information-Theoretic Soundness and Completeness of Formal Encryption., , и . CSFW, стр. 170-184. IEEE Computer Society, (2005)Soundness and Completeness of Formal Logics of Symmetric Encryption.. IACR Cryptology ePrint Archive, (2005)Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker., , и . ESORICS (2), том 11099 из Lecture Notes in Computer Science, стр. 350-372. Springer, (2018)Computational Semantics for Basic Protocol Logic - A Stochastic Approach., , и . ASIAN, том 4846 из Lecture Notes in Computer Science, стр. 86-94. Springer, (2007)Computational Soundness of Formal Indistinguishability and Static Equivalence., , и . ASIAN, том 4435 из Lecture Notes in Computer Science, стр. 182-196. Springer, (2006)Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4., и . CSL, том 62 из LIPIcs, стр. 34:1-34:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Towards Unconditional Soundness: Computationally Complete Symbolic Attacker., и . POST, том 7215 из Lecture Notes in Computer Science, стр. 189-208. Springer, (2012)