Sciweavers

340 search results - page 45 / 68
» Cryptography: An Art and Science
Sort
View
CAE
2010
15 years 1 months ago
Learning about Shadows from Artists
Renaissance artists discovered methods for imaging realistic depth on a two dimensional surface by re-inventing linear perspective. In solving the problem of depth depiction, they...
Elodie Fourquet
165
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 6 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 6 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 6 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
16 years 6 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao