Sciweavers

2601 search results - page 366 / 521
» Secure Rewarding Schemes
Sort
View
ECRIME
2007
15 years 8 months ago
Evaluating a trial deployment of password re-use for phishing prevention
We propose a scheme that exploits scale to prevent phishing. We show that while stopping phishers from obtaining passwords is very hard, detecting the fact that a password has bee...
Dinei A. F. Florêncio, Cormac Herley
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
15 years 10 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
157
Voted
ASIACRYPT
2004
Springer
15 years 10 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
SP
2010
IEEE
206views Security Privacy» more  SP 2010»
15 years 8 months ago
Revocation Systems with Very Small Private Keys
In this work, we design a method for creating public key broadcast encryption systems. Our main technical innovation is based on a new “two equation” technique for revoking us...
Allison B. Lewko, Amit Sahai, Brent Waters
175
Voted
JOC
2007
133views more  JOC 2007»
15 years 4 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin