Sciweavers

400 search results - page 51 / 80
» Cryptography and computer security for undergraduates
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 3 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
CHI
2010
ACM
15 years 4 months ago
Friends only: examining a privacy-enhancing behavior in facebook
Privacy practices in social network sites often appear paradoxical, as content-sharing behavior stands in conflict with the need to reduce disclosure-related harms. In this study ...
Fred Stutzman, Jacob Kramer-Duffield
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 2 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
SDMW
2009
Springer
15 years 2 months ago
Longitude: Centralized Privacy-Preserving Computation of Users' Proximity
A “friend finder” is a Location Based Service (LBS) that informs users about the presence of participants in a geographical area. In particular, one of the functionalities of ...
Sergio Mascetti, Claudio Bettini, Dario Freni
TCOS
2010
14 years 4 months ago
J-PAKE: Authenticated Key Exchange without PKI
Password Authenticated Key Exchange (PAKE) is one of the important topics in cryptography. It aims to address a practical security problem: how to establish secure communication be...
Feng Hao, Peter Ryan