Sciweavers

2735 search results - page 232 / 547
» Comparing notions of randomness
Sort
View
PROVSEC
2009
Springer
14 years 3 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo
IJCAI
1989
13 years 12 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine
ATAL
2010
Springer
13 years 12 months ago
On the limits of dictatorial classification
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
CRYPTO
2010
Springer
171views Cryptology» more  CRYPTO 2010»
13 years 12 months ago
Credential Authenticated Identification and Key Exchange
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
Jan Camenisch, Nathalie Casati, Thomas Groß,...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 11 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder