Sciweavers

621 search results - page 31 / 125
» Efficient Secure Multi-party Computation
Sort
View
EUROCRYPT
2004
Springer
14 years 2 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 11 months ago
Trusted Computing in Mobile Action
Due to the convergence of various mobile access technologies like UMTS, WLAN, and WiMax the need for a new supporting infrastructure arises. This infrastructure should be able to ...
Nicolai Kuntze, Andreas U. Schmidt
AINA
2005
IEEE
14 years 4 months ago
An Improved Low Computation Cost User Authentication Scheme for Mobile Communication
Most of existing user authentication schemes require high computation cost of exponentiation operations for the purpose of security. However, it is not suitable for mobile devices...
Chia-Yin Lee, Chu-Hsing Lin, Chin-Chen Chang
IJNSEC
2008
115views more  IJNSEC 2008»
13 years 11 months ago
A Simple User Authentication Scheme for Grid Computing
The security issue has become an important concern of grid computing. To prevent the grid resources from being illegally visited, the strong mutual authentication is needed for us...
Rongxing Lu, Zhenfu Cao, Zhenchuan Chai, Xiaohui L...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 2 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...