How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A survey of fast exponentiation methods
Journal of Algorithms
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
RIPEMD-160: A Strengthened Version of RIPEMD
Proceedings of the Third International Workshop on Fast Software Encryption
Protecting data privacy through hard-to-reverse negative databases
International Journal of Information Security
Fast exponentiation with precomputation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
An improved protocol for demonstrating possession of discrete logarithms and some generalizations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Protecting data privacy through hard-to-reverse negative databases
ISC'06 Proceedings of the 9th international conference on Information Security
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Protecting poorly chosen secrets from guessing attacks
IEEE Journal on Selected Areas in Communications
Hiding a Needle in a Haystack Using Negative Databases
Information Hiding
Negative databases for biometric data
Proceedings of the 12th ACM workshop on Multimedia and security
Countering GATTACA: efficient and secure testing of fully-sequenced human genomes
Proceedings of the 18th ACM conference on Computer and communications security
More than modelling and hiding: towards a comprehensive view of Web mining and privacy
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
A negative database is a privacy-preserving storage system that allows to efficiently test if an entry is present, but makes it hard to enumerate all encoded entries. We improve significantly over previous work presented at ISC 2006 by Esponda et al. [9], by showing constructions for negative databases reducible to the security of well understood primitives, such as cryptographic hash functions or the hardness of the Discrete-Logarithm problem. Our constructions require only O(m) storage in the number m of entries in the database, and linear query time (compared to O(l ċ m) storage and O(l ċ m) query time, where l is a security parameter.) Our claims are supported by both proofs of security and experimental performance measurements.