Sciweavers

555 search results - page 16 / 111
» From ABZ to Cryptography
Sort
View
SACRYPT
2009
Springer
212views Cryptology» more  SACRYPT 2009»
14 years 4 months ago
Compact McEliece Keys from Goppa Codes
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
Rafael Misoczki, Paulo S. L. M. Barreto
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 4 months ago
From Weak to Strong Watermarking
The informal goal of a watermarking scheme is to “mark” a digital object, such as a picture or video, in such a way that it is difficult for an adversary to remove the mark wit...
Nicholas Hopper, David Molnar, David Wagner
TCC
2007
Springer
145views Cryptology» more  TCC 2007»
14 years 4 months ago
(Password) Authenticated Key Establishment: From 2-Party to Group
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
Michel Abdalla, Jens-Matthias Bohli, Maria Isabel ...
FSTTCS
2003
Springer
14 years 3 months ago
Moderately Hard Functions: From Complexity to Spam Fighting
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
Moni Naor
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
14 years 3 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev