Searching for authors named "Bogdan Warinschi" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

17 documents found, showing 1 through 10. Next 10 →

Soundness of Formal Encryption in the Presence ofActive Adversaries
by Daniele Micciancio, Bogdan Warinschi
… and Bogdan Warinschi Dept. of Computer Science & EngineeringUniversity of California at San Diego…
Add To MetaCart

Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions
by Daniele Micciancio, Bogdan Warinschi — 2002 — Journal of Computer Security
… Bogdan Warinschi Department of Computer Science and Engineering, University of California, San Diego 9500…
Cited by 11 (0 self) – Add To MetaCart

A Linear Space Algorithm for Computing the Hermite Normal Form
by Daniele Micciancio, Bogdan Warinschi — 2001 — Proceedings ISSAC 2001, Lecture Notes in Computer Sci., 2146
…@(email omitted); Bogdan Warinschi University of California, San Diego 9500 Gilman Drive, Mail Code 0114 La Jolla…
Cited by 5 (1 self) – Add To MetaCart

Password-based encryption analyzed
by Martín Abadi, Bogdan Warinschi — 2005 — In Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP’05), volume 3580 of LNCS
…Password-Based Encryption Analyzed Martín Abadi 1 and Bogdan Warinschi 2 1 Computer Science…
Cited by 1 (1 self) – Add To MetaCart

Computationally sound, automated proofs for security protocols
by Véronique Cortier, Bogdan Warinschi — 2005
… ⋆⋆ and Bogdan Warinschi 1 cortier@(email omitted);, Loria, CNRS, Nancy, France, fax: (+33) 3 83 27 83 19 2 bogdan…
Cited by 32 (4 self) – Add To MetaCart

Soundness of formal encryption in the presence of active adversaries
by Daniele Micciancio, Bogdan Warinschi — 2004 — In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of LNCS
… and Bogdan Warinschi Dept. of Computer Science & Engineering University of California at San Diego…
Cited by 52 (6 self) – Add To MetaCart

Guessing attacks and the computational soundness of static equivalence
by Mathieu Baudet, Bogdan Warinschi — 2006 — In Proc. 9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS’06), volume 3921 of LNCS
… Baudet2, and Bogdan Warinschi3 1 University of California, Santa Cruz 2 LSV, CNRS & INRIA Futurs projet…
Cited by 18 (0 self) – Add To MetaCart

A Computational Analysis of the Needham-Schr oeder-(Lowe) Protocol
by Bogdan Warinschi Department
…-Zurich Research Laboratory BOGDAN WARINSCHI ∗ Department of Computer Science and Engineering, University…
Add To MetaCart

Computationally sound symbolic secrecy in the presence of hash functions
by Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi — 2006 — Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’06), volume 4337 of Lecture Notes in Computer Science
… Kremer 2 , Ralf Küsters 3 , and Bogdan Warinschi 1 1 Loria, CNRS & INRIA project Cassis, Nancy, France 2…
Cited by 5 (1 self) – Add To MetaCart

Soundness of Symbolic Equivalence for Modular Exponentiation
by Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi — 2006 — In Proceedings of the Second Workshop on Formal and Computational Cryptography (FCC’06
… , and Bogdan Warinschi 2 VERIMAG, Grenoble, France, {yassine.lakhnech,laurent.mazare}@(email omitted); LORIA, Nancy…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB