Sciweavers

741 search results - page 128 / 149
» Verification of security protocols using LOTOS-method and ap...
Sort
View
OOPSLA
2010
Springer
13 years 6 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
14 years 9 months ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov
IACR
2011
152views more  IACR 2011»
12 years 8 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
SDMW
2009
Springer
14 years 1 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
PLDI
2010
ACM
14 years 6 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala