Sciweavers

39 search results - page 7 / 8
» General Composition and Universal Composability in Secure Mu...
Sort
View
CSFW
2006
IEEE
13 years 11 months ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
ESORICS
2006
Springer
13 years 9 months ago
Conditional Reactive Simulatability
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...
Michael Backes, Markus Dürmuth, Dennis Hofhei...
CCS
2007
ACM
13 years 11 months ago
Split-ballot voting: everlasting privacy with distributed trust
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
Tal Moran, Moni Naor
IACR
2011
105views more  IACR 2011»
12 years 5 months ago
Leakage Tolerant Interactive Protocols
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
Nir Bitansky, Ran Canetti, Shai Halevi
MIDDLEWARE
2007
Springer
13 years 11 months ago
A service-oriented virtual community overlay network for secure external service orchestration
The Service Oriented Architecture (SOA) is used extensively in ubiquitous computing environments. Using external service orchestration, services can be composed into applications....
Shudong Chen, Johan J. Lukkien