Sciweavers

2432 search results - page 222 / 487
» Cryptographic logical relations
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
EUROCRYPT
2009
Springer
16 years 7 months ago
Order-Preserving Symmetric Encryption
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...
Alexandra Boldyreva, Nathan Chenette, Younho Lee, ...
CSFW
2009
IEEE
16 years 1 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
SP
2008
IEEE
100views Security Privacy» more  SP 2008»
16 years 29 days ago
Towards Practical Privacy for Genomic Computation
Many basic tasks in computational biology involve operations on individual DNA and protein sequences. These sequences, even when anonymized, are vulnerable to re-identification a...
Somesh Jha, Louis Kruger, Vitaly Shmatikov
ACSAC
2006
IEEE
16 years 20 days ago
Engineering Sufficiently Secure Computing
We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal v...
Brian Witten