Sciweavers

3228 search results - page 508 / 646
» Computationally Sound Proofs
Sort
View
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
16 years 3 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
TLDI
2010
ACM
190views Formal Methods» more  TLDI 2010»
15 years 12 months ago
Distributed programming with distributed authorization
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
Kumar Avijit, Anupam Datta, Robert Harper
LICS
2009
IEEE
15 years 9 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 8 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
EUROCRYPT
2005
Springer
15 years 8 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...