140 search results - page 17 / 28 » Doing More with Fewer Bits |
EUROCRYPT
1997
Springer
13 years 11 months ago
1997
Springer
Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two string OT, a sender offers two strings, one of which the other party, called the receive...
LATINCRYPT
2010
13 years 6 months ago
2010
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
SIAMCOMP
2010
13 years 2 months ago
2010
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
IVC
2007
13 years 7 months ago
2007
We present a variation to the well studied SVD based image compression technique. Our variation can be viewed as a preprocessing step in which the input image is permuted as per a...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...