Sciweavers

659 search results - page 38 / 132
» Compiling and securing cryptographic protocols
Sort
View
IACR
2011
107views more  IACR 2011»
14 years 2 days ago
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not...
Jan Camenisch, Kristiyan Haralambiev, Markulf Kohl...
CSFW
2006
IEEE
15 years 6 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
FORTE
2004
15 years 1 months ago
A Construction Kit for Modeling the Security of M-commerce Applications
Abstract. In this article we present a method to avoid security problems in modern m-commerce applications. The security problems that we are addressing are breaches of security du...
Dominik Haneberg, Wolfgang Reif, Kurt Stenzel
CCS
2008
ACM
15 years 2 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
CONCUR
2005
Springer
15 years 6 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters