Sciweavers

37 search results - page 6 / 8
» Secure Multi-party Computation Minimizing Online Rounds
Sort
View
JUCS
2008
156views more  JUCS 2008»
13 years 5 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
WPES
2005
ACM
13 years 11 months ago
Information revelation and privacy in online social networks
Participation in social networking sites has dramatically increased in recent years. Services such as Friendster, Tribe, or the Facebook allow millions of individuals to create on...
Ralph Gross, Alessandro Acquisti, H. John Heinz II...
TRUST
2010
Springer
13 years 10 months ago
Token-Based Cloud Computing
Secure outsourcing of computation to an untrusted (cloud) service provider is becoming more and more important. Pure cryptographic solutions based on fully homomorphic and verifia...
Ahmad-Reza Sadeghi, Thomas Schneider 0003, Marcel ...
NDSS
1999
IEEE
13 years 10 months ago
Secure Password-Based Protocol for Downloading a Private Key
We present protocols that allow a user Alice, knowing only her name and password, and not carrying a smart card, to "log in to the network" from a "generic" wo...
Radia J. Perlman, Charlie Kaufman
OPODIS
2010
13 years 3 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas