Sciweavers

216 search results - page 27 / 44
» Formal Proofs for the Security of Signcryption
Sort
View
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
SP
2009
IEEE
101views Security Privacy» more  SP 2009»
14 years 2 months ago
Noninterference for a Practical DIFC-Based Operating System
The Flume system is an implementation of decentralized information flow control (DIFC) at the operating system level. Prior work has shown Flume can be implemented as a practical ...
Maxwell N. Krohn, Eran Tromer
ISCI
2008
160views more  ISCI 2008»
13 years 7 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
ET
2010
89views more  ET 2010»
13 years 6 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard
CCS
2003
ACM
14 years 22 days ago
Origin authentication in interdomain routing
Attacks against Internet routing are increasing in number and severity. Contributing greatly to these attacks is the absence of origin authentication: there is no way to validate ...
William Aiello, John Ioannidis, Patrick Drew McDan...