#### Filter Results:

- Full text PDF available (74)

#### Publication Year

1998

2017

- This year (4)
- Last 5 years (32)
- Last 10 years (62)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mihir Bellare, Daniele Micciancio, Bogdan Warinschi
- EUROCRYPT
- 2003

This paper provides theoretical foundations for the group signature primitive. We introduce strong, formal definitions for the core requirements of anonymity and traceability. We then show that these imply the large set of sometimes ambiguous existing informal requirements in the literature, thereby unifying and simplifying the requirements for this… (More)

- Alexandra Boldyreva, Adriana Palacio, Bogdan Warinschi
- Journal of Cryptology
- 2003

A proxy signature scheme permits an entity to delegate its signing rights to another. These schemes have been suggested for use in numerous applications, particularly in distributed computing. Before our work (Boldyreva et al. in Cryptology ePrint Archive, Report 2003/096, 2003) appeared, no precise definitions or proven-secure schemes had been provided. In… (More)

- Daniele Micciancio, Bogdan Warinschi
- TCC
- 2004

We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbitrary expressions built using encryption and concatenation operations. The method allows to express security properties and carry out proofs using a simple logic based language, where… (More)

- David Bernhard, Olivier Pereira, Bogdan Warinschi
- ASIACRYPT
- 2012

The Fiat-Shamir transformation is the most efficient construction of non-interactive zero-knowledge proofs. This paper is concerned with two variants of the transformation that appear but have not been clearly delineated in existing literature. Both variants start with the prover making a commitment. The strong variant then hashes both the commitment and… (More)

- Véronique Cortier, Bogdan Warinschi
- ESOP
- 2005

Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and probability. This approach captures a strong notion of security, guaranteed against all probabilistic polynomial-time attacks. The other approach relies on a symbolic model of… (More)

- Daniele Micciancio, Bogdan Warinschi
- Journal of Computer Security
- 2004

We show that the Abadi-Rogaway logic of indistinguishability for cryptographic expressions is not complete by giving a natural example of a secure encryption function and a pair of expressions, such that the distributions associated to the two expressions are computationally indistinguishable, but equality cannot be proved within the logic. We then… (More)

- Anupam Datta, Ante Derek, John C. Mitchell, Bogdan Warinschi
- 19th IEEE Computer Security Foundations Workshop…
- 2006

We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventional runs of a protocol against a probabilistic polynomial-time attacker. Since reasoning about an unbounded number of runs of a protocol involves induction-like arguments about… (More)

- Paul Morrissey, Nigel P. Smart, Bogdan Warinschi
- IACR Cryptology ePrint Archive
- 2008

We study the security of the widely deployed Secure Session Layer/Transport Layer Security (TLS) key agreement protocol. Our analysis identifies, justifies, and exploits the modularity present in the design of the protocol: the application keys offered to higher level applications are obtained from a master key, which in turn is derived, through… (More)

- Dario Catalano, Dario Fiore, Bogdan Warinschi
- IACR Cryptology ePrint Archive
- 2011

Network Coding is a routing technique where each node may actively modify the received packets before transmitting them. While this departure from passive networks improves throughput and resilience to packet loss it renders transmission susceptible to pollution attacks where nodes can misbehave and change in a malicious way the messages transmitted. Nodes… (More)

- Martín Abadi, Bogdan Warinschi
- ICALP
- 2005

The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the context of a recent line of research that aims to justify symbolic models in terms of more concrete, computational ones. We offer two models for reasoning about the concurrent use of symmetric,… (More)