Sciweavers

783 search results - page 56 / 157
» On security proof of McCullagh
Sort
View
CSFW
2008
IEEE
14 years 4 months ago
Language Based Secure Communication
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
Michele Bugliesi, Riccardo Focardi
CCS
2000
ACM
14 years 2 months ago
Composition and integrity preservation of secure reactive systems
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...
Birgit Pfitzmann, Michael Waidner
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
14 years 6 months ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
TARK
2007
Springer
14 years 4 months ago
Preservation of epistemic properties in security protocol implementations
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...
Ron van der Meyden, Thomas Wilke
ISCIS
2003
Springer
14 years 3 months ago
Design and Implementation of a Secure Group Communication Protocol on a Fault Tolerant Ring
In this paper, we describe a secure group communication protocol for a fault-tolerant synchronous ring. Our protocol, named Secure Synchronous Ring Protocol (SSRP), integrates a se...
Özgür Saglam, Mehmet E. Dalkilç, ...