73 search results - page 6 / 15 » An Improved Construction for Universal Re-encryption |
DCC
2010
IEEE
13 years 11 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
IEEECIT
2010
IEEE
13 years 6 months ago
2010
IEEE
—“Network Storage and System Virtualization Technologies” is an up-to-date course opened by the school of electronics engineering and computer science of Peking University. T...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present an asymptotically optimal reduction of one-outof-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunctio...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...