Sciweavers

570 search results - page 71 / 114
» Black-box constructions for secure computation
Sort
View
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Public-Key Locally-Decodable Codes
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
Brett Hemenway, Rafail Ostrovsky
ISI
2006
Springer
13 years 8 months ago
Collective Sampling and Analysis of High Order Tensors for Chatroom Communications
This work investigates the accuracy and efficiency tradeoffs between centralized and collective (distributed) algorithms for (i) sampling, and (ii) n-way data analysis techniques i...
Evrim Acar, Seyit Ahmet Çamtepe, Bülen...
ICITS
2009
13 years 5 months ago
Linear Threshold Multisecret Sharing Schemes
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
Oriol Farràs, Ignacio Gracia, Sebasti&agrav...
SACMAT
2006
ACM
14 years 1 months ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
CCS
2001
ACM
13 years 11 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