Sciweavers

555 search results - page 37 / 111
» From ABZ to Cryptography
Sort
View
CTRSA
2005
Springer
78views Cryptology» more  CTRSA 2005»
14 years 3 months ago
New Minimal Weight Representations for Left-to-Right Window Methods
For an integer w ≥ 2, a radix 2 representation is called a width-w nonadjacent form (w-NAF, for short) if each nonzero digit is an odd integer with absolute value less than 2w−...
James A. Muir, Douglas R. Stinson
EUROCRYPT
2005
Springer
14 years 3 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
CRYPTO
2000
Springer
134views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Taming the Adversary
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
Martín Abadi
ACISP
2004
Springer
14 years 1 months ago
Secure Bilinear Diffie-Hellman Bits
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been u...
Steven D. Galbraith, Herbie J. Hopkins, Igor Shpar...
EUROCRYPT
2006
Springer
14 years 1 months ago
Composition Implies Adaptive Security in Minicrypt
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
Krzysztof Pietrzak