Sciweavers

24 search results - page 2 / 5
» Secure Computation of the k th-Ranked Element
Sort
View
CCS
2001
ACM
13 years 9 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
EUROCRYPT
2004
Springer
13 years 9 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
SACMAT
2010
ACM
13 years 3 months ago
Enforcing spatial constraints for mobile RBAC systems
Proposed models for spatially-aware extensions of role-based access control (RBAC) combine the administrative and security advantages of RBAC with the dynamic nature of mobile and...
Michael S. Kirkpatrick, Elisa Bertino
CRYPTO
2000
Springer
128views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
The XTR Public Key System
This paper introduces the XTR public key system. XTR is based on a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR ...
Arjen K. Lenstra, Eric R. Verheul
ICALP
2007
Springer
13 years 11 months ago
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...
Tal Moran, Moni Naor, Gil Segev