Sciweavers

CRYPTO
2005
Springer
97views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
Generic Transformation for Scalable Broadcast Encryption Schemes
Broadcast encryption schemes allow a message sender to broadcast an encrypted data so that only legitimate receivers decrypt it. Because of the intrinsic nature of one-to-many comm...
Jung Yeon Hwang, Dong Hoon Lee, Jongin Lim
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...
Thomas Holenstein, Renato Renner
CRYPTO
2005
Springer
104views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
On the Discrete Logarithm Problem on Algebraic Tori
Abstract. Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm pr...
Robert Granger, Frederik Vercauteren
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
13 years 9 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
163views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
CRYPTO
2005
Springer
107views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
A Quantum Cipher with Near Optimal Key-Recycling
Abstract. Assuming an insecure quantum channel and an authenticated classical channel, we propose an unconditionally secure scheme for encrypting classical messages under a shared ...
Ivan Damgård, Thomas Brochmann Pedersen 0002...
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
13 years 9 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
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...