Sciweavers

489 search results - page 19 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
EUROCRYPT
2004
Springer
15 years 3 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
ICC
2008
IEEE
134views Communications» more  ICC 2008»
15 years 4 months ago
Secret Little Functions and Codebook for Protecting Users from Password Theft
—In this paper, we discuss how to prevent users’ passwords from being stolen by adversaries. We propose differentiated security mechanisms in which a user has the freedom to ch...
Yang Xiao, Chung-Chih Li, Ming Lei, Susan V. Vrbsk...
IACR
2011
127views more  IACR 2011»
13 years 10 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
ICC
2007
IEEE
15 years 4 months ago
Low-Complexity EM-based Joint CFO and IQ imbalance Acquisition
—New air interfaces are currently being developed to meet the high spectral efficiency requirements of the emerging wireless communication systems. In this context, OFDM is cons...
François Horlin, André Bourdoux, Edu...
95
Voted
SAC
2004
ACM
15 years 3 months ago
A decision-theoretic approach for designing proactive communication in multi-agent teamwork
Techniques that support effective communication during teamwork processes are of particular importance. Psychological study shows that an effective team often can anticipate infor...
Yu Zhang, Richard A. Volz, Thomas R. Ioerger, John...