Sciweavers

127 search results - page 20 / 26
» On Cryptographic Schemes Based on Discrete Logarithms and Fa...
Sort
View
CCS
2001
ACM
13 years 11 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
CCS
2004
ACM
14 years 1 months ago
Private inference control
Access control can be used to ensure that database queries pertaining to sensitive information are not answered. This is not enough to prevent users from learning sensitive inform...
David P. Woodruff, Jessica Staddon
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 5 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
ICIP
2008
IEEE
14 years 9 months ago
Lossy to lossless image compression based on reversible integer DCT
A progressive image compression scheme is investigated using reversible integer discrete cosine transform (RDCT) which is derived from the matrix factorization theory. Previous te...
Lei Wang, Jiaji Wu, Licheng Jiao, Li Zhang, Guangm...
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
14 years 8 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan