Sciweavers

123 search results - page 17 / 25
» Composable Security in the Bounded-Quantum-Storage Model
Sort
View
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
CCS
2009
ACM
15 years 4 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
ENTCS
2007
150views more  ENTCS 2007»
14 years 9 months ago
On the Expressiveness of Mobile Synchronizing Petri Nets
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a coll...
Fernando Rosa Velardo, David de Frutos-Escrig, Olg...
TES
2001
Springer
15 years 1 months ago
Security for Distributed E-Service Composition
Current developments show that tomorrow’s information systems and applications will no longer be based on monolithic architectures that encompass all the functionality. Rather, t...
Stefan Seltzsam, Stephan Börzsönyi, Alfo...
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
15 years 10 months ago
LEGO for Two-Party Secure Computation
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
Jesper Buus Nielsen, Claudio Orlandi