35 search results - page 5 / 7 » Oblivious Transfer and Polynomial Evaluation |
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
Abstract— Frequency dependent interconnect analysis is challenging since lumped equivalent circuit models extracted at different frequencies exhibit distinct time and frequency d...
ESORICS
2005
Springer
14 years 18 days ago
2005
Springer
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
TIT
2008
13 years 7 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
PET
2010
Springer
13 years 11 months ago
2010
Springer
Combining and analyzing data collected at multiple locations is critical for a wide variety of applications, such as detecting and diagnosing malicious attacks or computing an acc...
CRYPTO
2010
Springer
13 years 3 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...