The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Bogdan Warinschi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bogdan Warinschi
    A Computational Analysis of the Needham-Schröeder-(Lowe) Protocol. [Citation Graph (0, 0)][DBLP]
    CSFW, 2003, pp:248-0 [Conf]
  2. Anupam Datta, Ante Derek, John C. Mitchell, Bogdan Warinschi
    Computationally Sound Compositional Logic for Key Exchange Protocols. [Citation Graph (0, 0)][DBLP]
    CSFW, 2006, pp:321-334 [Conf]
  3. Véronique Cortier, Bogdan Warinschi
    Computationally Sound, Automated Proofs for Security Protocols. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:157-171 [Conf]
  4. Mihir Bellare, Daniele Micciancio, Bogdan Warinschi
    Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:614-629 [Conf]
  5. Martín Abadi, Mathieu Baudet, Bogdan Warinschi
    Guessing Attacks and the Computational Soundness of Static Equivalence. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:398-412 [Conf]
  6. Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
    Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:176-187 [Conf]
  7. Martín Abadi, Bogdan Warinschi
    Password-Based Encryption Analyzed. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:664-676 [Conf]
  8. Michel Abdalla, Bogdan Warinschi
    On the Minimal Assumptions of Group Signature Schemes. [Citation Graph (0, 0)][DBLP]
    ICICS, 2004, pp:1-13 [Conf]
  9. Daniele Micciancio, Bogdan Warinschi
    A linear space algorithm for computing the herite normal form. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:231-236 [Conf]
  10. Martín Abadi, Bogdan Warinschi
    Security analysis of cryptographically controlled access to XML documents. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:108-117 [Conf]
  11. Jan Camenisch, Maciej Koprowski, Bogdan Warinschi
    Efficient Blind Signatures Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    SCN, 2004, pp:134-148 [Conf]
  12. Daniele Micciancio, Bogdan Warinschi
    Soundness of Formal Encryption in the Presence of Active Adversaries. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:133-151 [Conf]
  13. Daniele Micciancio, Bogdan Warinschi
    A Linear Space Algorithm for Computing the Hermite Normal Form [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:74, pp:- [Journal]
  14. Daniele Micciancio, Bogdan Warinschi
    Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2004, v:12, n:1, pp:99-130 [Journal]
  15. Bogdan Warinschi
    A computational analysis of the Needham-Schroeder-(Lowe) protocol. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2005, v:13, n:3, pp:565-591 [Journal]
  16. Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi
    A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:482-499 [Conf]
  17. Véronique Cortier, Ralf Küsters, Bogdan Warinschi
    A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2007, pp:422-437 [Conf]
  18. Véronique Cortier, Bogdan Warinschi, Eugen Zalinescu
    Synthesizing Secure Protocols. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2007, pp:406-421 [Conf]
  19. Alexandra Boldyreva, Marc Fischlin, Adriana Palacio, Bogdan Warinschi
    A Closer Look at PKI: Security and Efficiency. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2007, pp:458-475 [Conf]
  20. Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi
    Explicit Randomness is not Necessary when Modeling Probabilistic Encryption [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  21. Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi
    Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:186, n:, pp:49-65 [Journal]

  22. A Modular Security Analysis of the TLS Handshake Protocol. [Citation Graph (, )][DBLP]


  23. Foundations of Non-malleable Hash and One-Way Functions. [Citation Graph (, )][DBLP]


  24. Security Notions and Generic Constructions for Client Puzzles. [Citation Graph (, )][DBLP]


  25. Robustness Guarantees for Anonymity. [Citation Graph (, )][DBLP]


  26. Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption. [Citation Graph (, )][DBLP]


  27. Practical Zero-Knowledge Proofs for Circuit Evaluation. [Citation Graph (, )][DBLP]


  28. Groth-Sahai Proofs Revisited. [Citation Graph (, )][DBLP]


  29. The Fiat-Shamir Transform for Group and Ring Signature Schemes. [Citation Graph (, )][DBLP]


  30. Get Shorty via Group Signatures without Encryption. [Citation Graph (, )][DBLP]


  31. Identity Based Group Signatures from Hierarchical Identity-Based Encryption. [Citation Graph (, )][DBLP]


  32. Symbolic Methods for Provable Security. [Citation Graph (, )][DBLP]


  33. Certified Encryption Revisited. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.306secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002