Sciweavers

141 search results - page 5 / 29
» Oblivious Transfer and Linear Functions
Sort
View
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
14 years 24 days ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
ICASSP
2008
IEEE
14 years 5 months ago
Identification of linear systems with adaptive control of the cross-multiplicative transfer function approximation
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
Yekutiel Avargel, Israel Cohen
CDC
2009
IEEE
221views Control Systems» more  CDC 2009»
14 years 2 months ago
Parametrization invariant covariance quantification in identification of transfer functions for linear systems
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
Tzvetan Ivanov, Michel Gevers
ICC
2007
IEEE
165views Communications» more  ICC 2007»
14 years 5 months ago
Oblivious Keyword Search Protocols in the Public Database Model
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
Huafei Zhu, Feng Bao
TCC
2005
Springer
139views Cryptology» more  TCC 2005»
14 years 4 months ago
The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives
Abstract. We consider the problem of password-authenticated key exchange (PAK) also known as session-key generation using passwords: constructing session-key generation protocols t...
Minh-Huyen Nguyen