Sciweavers

119 search results - page 7 / 24
» Finite models for formal security proofs
Sort
View
CCS
2006
ACM
13 years 11 months ago
Ring signatures without random oracles
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
Sherman S. M. Chow, Victor K.-W. Wei, Joseph K. Li...
EUROCRYPT
2001
Springer
14 years 3 hour ago
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
Ran Canetti, Hugo Krawczyk
FMCO
2007
Springer
124views Formal Methods» more  FMCO 2007»
13 years 11 months ago
Certification Using the Mobius Base Logic
This paper describes a core component of Mobius' Trusted Code Base, the Mobius base logic. This program logic facilitates the transmission of certificates that are generated u...
Lennart Beringer, Martin Hofmann, Mariela Pavlova
ESORICS
2009
Springer
14 years 8 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
FMCAD
2006
Springer
13 years 11 months ago
Finite Instantiations for Integer Difference Logic
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
Hyondeuk Kim, Fabio Somenzi