Sciweavers

2601 search results - page 451 / 521
» Secure Rewarding Schemes
Sort
View
FSTTCS
2003
Springer
15 years 8 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
167
Voted
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
15 years 8 months ago
Delayed-Key Message Authentication for Streams
We consider message authentication codes for streams where the key becomes known only at the end of the stream. This usually happens in key-exchange protocols like SSL and TLS wher...
Marc Fischlin, Anja Lehmann
EUROCRYPT
2001
Springer
15 years 7 months ago
Key Recovery and Message Attacks on NTRU-Composite
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...
Craig Gentry
ASIACRYPT
1999
Springer
15 years 7 months ago
Periodical Multi-secret Threshold Cryptosystems
A periodical multi-secret threshold cryptosystem enables a sender to encrypt a message by using a cyclical sequence of keys which are shared by n parties and periodically updated. ...
Masayuki Numao
FSE
1997
Springer
112views Cryptology» more  FSE 1997»
15 years 7 months ago
A Family of Trapdoor Ciphers
This paper presents several methods to construct trapdoor block ciphers. A trapdoor cipher contains some hidden structure; knowledge of this structure allows an attacker to obtain ...
Vincent Rijmen, Bart Preneel