Sciweavers

105 search results - page 10 / 21
» A General Composition Theorem for Secure Reactive Systems
Sort
View
ISW
2004
Springer
15 years 5 months ago
Low-Level Ideal Signatures and General Integrity Idealization
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
Michael Backes, Birgit Pfitzmann, Michael Waidner
87
Voted
ACMSE
2007
ACM
15 years 3 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...
EMSOFT
2005
Springer
15 years 5 months ago
Tag machines
Heterogeneity is a challenge to overcome in the design of embedded systems. We presented in the recent past a theory for the composition of heterogeneous components based on tagge...
Albert Benveniste, Benoît Caillaud, Luca P. ...
103
Voted
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
15 years 5 months ago
Chernoff-Type Direct Product Theorems
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
POPL
2012
ACM
13 years 7 months ago
A compiler and run-time system for network programming languages
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
Christopher Monsanto, Nate Foster, Rob Harrison, D...