Sciweavers

5484 search results - page 404 / 1097
» Almost-Everywhere Secure Computation
Sort
View
DIM
2008
ACM
15 years 8 months ago
Quantifying the security of preference-based authentication
We describe a technique aimed at addressing longstanding problems for password reset: security and cost. In our approach, users are authenticated using their preferences. Experime...
Markus Jakobsson, Liu Yang, Susanne Wetzel
ICISC
1998
132views Cryptology» more  ICISC 1998»
15 years 8 months ago
The flood-gate principle - a hybrid approach to a high security solution
The classical role of a firewall consists in protecting a computer network against attacks from the outside world, especially the Internet. Firewalls are often expensive, hard to c...
Ernst Georg Haffner, Thomas Engel, Christoph Meine...
JCS
2008
109views more  JCS 2008»
15 years 6 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
TOPLAS
2008
101views more  TOPLAS 2008»
15 years 6 months ago
Verifying policy-based web services security
WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract lang...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
TIT
2011
125views more  TIT 2011»
15 years 1 months ago
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
Benoît Libert, Damien Vergnaud