Sciweavers

2967 search results - page 370 / 594
» Cryptology
Sort
View
CTRSA
2008
Springer
134views Cryptology» more  CTRSA 2008»
15 years 8 months ago
An Efficient Protocol for Fair Secure Two-Party Computation
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
Mehmet S. Kiraz, Berry Schoenmakers
CTRSA
2008
Springer
160views Cryptology» more  CTRSA 2008»
15 years 8 months ago
Fault Analysis Study of IDEA
We present a study of several fault attacks against the block cipher IDEA. Such a study is particularly interesting because of the target cipher's specific property to employ ...
Christophe Clavier, Benedikt Gierlichs, Ingrid Ver...
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
15 years 8 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
CTRSA
2008
Springer
110views Cryptology» more  CTRSA 2008»
15 years 8 months ago
RFID Security: Tradeoffs between Security and Efficiency
Recently, Juels and Weis defined strong privacy for RFID tags. We add to this definition a completeness and a soundness requirement, i.e., a reader should accept valid tags and onl...
Ivan Damgård, Michael Østergaard Pede...
EUROCRYPT
2008
Springer
15 years 8 months ago
Precise Concurrent Zero Knowledge
Precise zero knowledge introduced by Micali and Pass (STOC'06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed t...
Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung D...