Sciweavers

239 search results - page 18 / 48
» Proof Techniques for Cryptographic Processes
Sort
View
CCS
2008
ACM
13 years 10 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
LICS
2006
IEEE
14 years 2 months ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon
CPP
2011
98views more  CPP 2011»
12 years 8 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach
WPES
2005
ACM
14 years 2 months ago
Anonymous yet accountable access control
This paper introduces a novel approach for augmenting attributebased access control systems in a way that allows them to offer fully anonymous access to resources while at the sam...
Michael Backes, Jan Camenisch, Dieter Sommer
ICIP
2004
IEEE
14 years 10 months ago
A framework for soft hashing and its application to robust image hashing
An increasing interest in the soft hashing problem has been witnessed in recent times. Techniques implementing soft hashing intend to mirror the behaviour of cryptographic hashing...
Elizabeth P. McCarthy, Félix Balado, Guenol...