Sciweavers

165 search results - page 2 / 33
» Safely Composing Security Protocols
Sort
View
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
14 years 2 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
ICALP
2007
Springer
13 years 10 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
14 years 2 months ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to a...
Jörn Müller-Quade, Dominique Unruh
IJACT
2008
102views more  IJACT 2008»
13 years 8 months ago
An optimistic fair exchange protocol and its security in the universal composability framework
: Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimi...
Yusuke Okada, Yoshifumi Manabe, Tatsuaki Okamoto
CORR
2007
Springer
150views Education» more  CORR 2007»
13 years 8 months ago
Composable Security in the Bounded-Quantum-Storage Model
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
Stephanie Wehner, Jürg Wullschleger