3735 search results - page 85 / 747 » Order compression schemes |
EUROCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
SIGMOD
2004
ACM
16 years 21 days ago
2004
ACM
Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an or...
91
Voted
FOSSACS
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
SIGSOFT
2005
ACM
16 years 1 months ago
2005
ACM
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
DCC
2006
IEEE
16 years 4 days ago
2006
IEEE
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...