123 search results - page 19 / 25 » Derandomizing from Random Strings |
130
click to vote
PKC
2004
Springer
15 years 10 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
132
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
165
click to vote
ASIACRYPT
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we discuss non-interactive updating of decryption keys in identity-based encryption (IBE). IBE is a public key cryptosystem where a public key is an arbitrary strin...
119
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
144
click to vote
CORR
2011
Springer
14 years 12 months ago
2011
Springer
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...