Sciweavers

658 search results - page 94 / 132
» Open problems in the security of learning
Sort
View
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
12 years 3 months ago
Subspace LWE
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
Krzysztof Pietrzak
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 7 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
ASIACRYPT
2008
Springer
13 years 9 months ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
EUROCRYPT
1999
Springer
14 years 4 hour ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 7 months ago
Settling the Polynomial Learnability of Mixtures of Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
Ankur Moitra, Gregory Valiant