Sciweavers

COLT
2007
Springer
13 years 10 months ago
Observational Learning in Random Networks
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stoc...
Julian Lorenz, Martin Marciniszyn, Angelika Steger
CCS
2007
ACM
13 years 10 months ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk
PROVSEC
2009
Springer
13 years 11 months ago
Chosen-Ciphertext Secure RSA-Type Cryptosystems
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the standard model. We rely on instance-independence assu...
Benoît Chevallier-Mames, Marc Joye
ICIC
2009
Springer
13 years 11 months ago
Group-Based Proxy Re-encryption Scheme
Recently, proxy re-encryption scheme received much attention. In this paper, we propose a proxy re-encryption used for divert ciphertext from one group to another. The scheme is bi...
Chunbo Ma, Jun Ao
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
13 years 11 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters