Sciweavers

1923 search results - page 7 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CONCUR
2008
Springer
13 years 10 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
ASIACRYPT
2010
Springer
13 years 6 months ago
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
Private Set Intersection (PSI) protocols allow one party ("client") to compute an intersection of its input set with that of another party ("server"), such tha...
Emiliano De Cristofaro, Jihye Kim, Gene Tsudik
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
14 years 2 months ago
Transforming Semi-Honest Protocols to Ensure Accountability
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...
Wei Jiang, Chris Clifton
PDCAT
2007
Springer
14 years 2 months ago
Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...
Yingpeng Sang, Hong Shen
FC
2005
Springer
83views Cryptology» more  FC 2005»
14 years 1 months ago
Secure Distributed Human Computation
We suggest a general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are e...
Craig Gentry, Zulfikar Ramzan, Stuart G. Stubblebi...