Sciweavers

STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 11 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
STOC
2005
ACM
103views Algorithms» more  STOC 2005»
14 years 11 months ago
New and improved constructions of non-malleable cryptographic protocols
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
Rafael Pass, Alon Rosen
STOC
2005
ACM
86views Algorithms» more  STOC 2005»
14 years 11 months ago
Low distortion embeddings for edit distance
Rafail Ostrovsky, Yuval Rabani
STOC
2005
ACM
84views Algorithms» more  STOC 2005»
14 years 11 months ago
Learning nonsingular phylogenies and hidden Markov models
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
Elchanan Mossel, Sébastien Roch
STOC
2005
ACM
94views Algorithms» more  STOC 2005»
14 years 11 months ago
On dynamic range reporting in one dimension
Christian Worm Mortensen, Rasmus Pagh, Mihai Patra...
STOC
2005
ACM
99views Algorithms» more  STOC 2005»
14 years 11 months ago
Collusion-free protocols
Matt Lepinski, Silvio Micali, Abhi Shelat
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 11 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 11 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
STOC
2005
ACM
89views Algorithms» more  STOC 2005»
14 years 11 months ago
Universal approximations for TSP, Steiner tree, and set cover
Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...