Sciweavers

610 search results - page 17 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
CCS
2008
ACM
14 years 11 months ago
Type-checking zero-knowledge
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. We show how several properties offered by zero-knowl...
Michael Backes, Catalin Hritcu, Matteo Maffei
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
15 years 1 months ago
The Composite Discrete Logarithm and Secure Authentication
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
David Pointcheval
CSFW
1996
IEEE
15 years 1 months ago
Comparing Two Information Flow Security Properties
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we...
Riccardo Focardi
TCC
2004
Springer
118views Cryptology» more  TCC 2004»
15 years 2 months ago
A General Composition Theorem for Secure Reactive Systems
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ACSAC
2010
IEEE
14 years 7 months ago
Keeping data secret under full compromise using porter devices
We address the problem of confidentiality in scenarios where the attacker is not only able to observe the communication between principals, but can also fully compromise the commu...
Christina Pöpper, David A. Basin, Srdjan Capk...