Sciweavers

141 search results - page 9 / 29
» Oblivious Transfer and Linear Functions
Sort
View
ECCC
2007
123views more  ECCC 2007»
13 years 11 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
FSTTCS
2009
Springer
14 years 5 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
14 years 11 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige
TCC
2009
Springer
160views Cryptology» more  TCC 2009»
14 years 11 months ago
Simple, Black-Box Constructions of Adaptively Secure Protocols
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
JMLR
2008
95views more  JMLR 2008»
13 years 11 months ago
Learning Similarity with Operator-valued Large-margin Classifiers
A method is introduced to learn and represent similarity with linear operators in kernel induced Hilbert spaces. Transferring error bounds for vector valued large-margin classifie...
Andreas Maurer