Sciweavers

128 search results - page 15 / 26
» Weak Verifiable Random Functions
Sort
View
AAAI
2010
13 years 10 months ago
Truth, Justice, and Cake Cutting
Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of...
Yiling Chen, John Lai, David C. Parkes, Ariel D. P...
WISE
2002
Springer
14 years 1 months ago
A Content-Based Resource Location Mechanism in PeerIS
With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in...
Bo Ling, Zhiguo Lu, Wee Siong Ng, Beng Chin Ooi, K...
TIT
2002
81views more  TIT 2002»
13 years 8 months ago
The decimation-Hadamard transform of two-level autocorrelation sequences
A new method to study and search for two-level autocorrelation sequences for both binary and nonbinary cases is developed. This method iteratively applies two operations: decimatio...
Guang Gong, Solomon W. Golomb
ICALP
2010
Springer
13 years 10 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CHES
2009
Springer
141views Cryptology» more  CHES 2009»
14 years 9 months ago
Fault Attacks on RSA Signatures with Partially Unknown Messages
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
Jean-Sébastien Coron, Antoine Joux, Ilya Ki...