Sciweavers

2108 search results - page 234 / 422
» Encrypted
Sort
View
CCS
2004
ACM
15 years 9 months ago
Cryptanalysis of a provably secure CRT-RSA algorithm
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
David Wagner
ICALP
2004
Springer
15 years 9 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier
CSFW
2003
IEEE
15 years 9 months ago
Type-Based Distributed Access Control
A type system is presented that combines a weak form of information flow control, termed distributed access control in the paper, with typed cryptographic operations. The motivat...
Tom Chothia, Dominic Duggan, Jan Vitek
EUROCRYPT
2010
Springer
15 years 9 months ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...
ICN
2001
Springer
15 years 8 months ago
Secure Communication: A New Application for Active Networks
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...
Manuel Günter, Marc Brogle, Torsten Braun