224 search results - page 25 / 45 » Secure Computation from Random Error Correcting Codes |
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
3DIM
2005
IEEE
14 years 29 days ago
2005
IEEE
Multimedia projectors and cameras make possible the use of structured light to solve problems such as 3D reconstruction, disparity map computation and camera or projector calibrat...
MEDIAFORENSICS
2010
13 years 8 months ago
2010
Security of biometric templates stored in a system is important because a stolen template can compromise system security as well as user privacy. Therefore, a number of secure bio...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...