Sciweavers

46 search results - page 3 / 10
» crypto 2005
Sort
View
CRYPTO
2005
Springer
110views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
Joël Alwen, Giuseppe Persiano, Ivan Visconti
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
We describe two new public key broadcast encryption systems for stateless receivers. Both systems are fully secure against any number of colluders. In our first construction both...
Dan Boneh, Craig Gentry, Brent Waters
CRYPTO
2005
Springer
94views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Improved Security Analyses for CBC MACs
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Pebbling and Proofs of Work
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
Cynthia Dwork, Moni Naor, Hoeteck Wee
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
Ronald Cramer, Serge Fehr, Martijn Stam