Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions.
Nishanth ChandranSanjam GargPublished in: INDOCRYPT (2014)
Keyphrases
- pseudorandom
- worst case
- random number
- database
- query processing
- response time
- query evaluation
- upper bound
- lower bound
- uniformly distributed
- retrieval systems
- relevance feedback
- query expansion
- data structure
- user queries
- computational complexity
- np complete
- database queries
- query formulation
- input data
- low dimensional
- range queries
- data sources
- wireless sensor networks
- np hard
- encryption algorithm