Sciweavers

37 search results - page 5 / 8
» Secure Multi-party Computation Minimizing Online Rounds
Sort
View
CHI
2009
ACM
14 years 8 months ago
Timing is everything?: the effects of timing and placement of online privacy indicators
Many commerce websites post privacy policies to address Internet shoppers' privacy concerns. However, few users read or understand them. Iconic privacy indicators may make pr...
Serge Egelman, Janice Y. Tsai, Lorrie Faith Cranor...
ICASSP
2011
IEEE
12 years 11 months ago
Efficiently computing private recommendations
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
Zekeriya Erkin, M. Beye, T. Veugen, Reginald L. La...
SEC
2001
13 years 9 months ago
Communication-Efficient Group Key Agreement
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
Yongdae Kim, Adrian Perrig, Gene Tsudik
ICISC
2008
103views Cryptology» more  ICISC 2008»
13 years 9 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003
DSN
2008
IEEE
14 years 2 months ago
Automatic security assessment of critical cyber-infrastructures
This research investigates the automation of security assessment of the static and dynamic properties of cyberinfrastructures, with emphasis on the electrical power grid. We descr...
Zahid Anwar, Ravinder Shankesi, Roy H. Campbell