Sciweavers

71 search results - page 10 / 15
» Round-Optimal Secure Two-Party Computation
Sort
View
IACR
2011
120views more  IACR 2011»
12 years 8 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
David Jao, Luca De Feo
EUROCRYPT
2004
Springer
14 years 2 months ago
Public-Key Steganography
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
Luis von Ahn, Nicholas J. Hopper
SDM
2004
SIAM
242views Data Mining» more  SDM 2004»
13 years 10 months ago
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification
Multivariate statistical analysis is an important data analysis technique that has found applications in various areas. In this paper, we study some multivariate statistical analy...
Wenliang Du, Yunghsiang S. Han, Shigang Chen
WISEC
2010
ACM
14 years 1 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 9 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford