Sciweavers

281 search results - page 49 / 57
» Non-black-box Techniques in Cryptography
Sort
View
SDMW
2009
Springer
14 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
SASN
2004
ACM
14 years 3 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
14 years 10 months ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
GLOBECOM
2009
IEEE
14 years 4 months ago
Reusable Set Constructions Using Randomized Dissolvent Templates for Biometric Security
—The emerging biometric cryptography has gained significant interests for key management and privacy protection, but the previously proposed schemes using set metrics for finge...
Jinyang Shi, Kwok-Yan Lam, Ming Gu, Husheng Li
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 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