11 search results - page 2 / 3 » Simple Adaptive Oblivious Transfer without Random Oracle |
192
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
131
Voted
ASIACRYPT
2007
Springer
15 years 11 months ago
2007
Springer
ersion of an extended abstract to be published in Advances in Cryptology—ASIACRYPT 2007, Springer-Verlag, 2007. Available online from: http://www.cs.stanford.edu/∼xb/asiacrypt0...
157
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
161
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
150
click to vote
ACNS
2008
Springer
15 years 12 months ago
2008
Springer
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...