Sciweavers

102 search results - page 14 / 21
» Bounded Query Functions with Limited Output Bits
Sort
View
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Efficient Hardware Search Engine for Associative Content Retrieval of Long Queries in Huge Multimedia Databases
Due to the enormous increase in the stored digital contents, search and retrieval functionalities are necessary in multimedia systems. Though processor speed for standard PCs (Per...
Christophe Layer, Hans-Jörg Pfleiderer
PVLDB
2010
91views more  PVLDB 2010»
13 years 5 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
EUROCRYPT
2009
Springer
14 years 8 months ago
A Leakage-Resilient Mode of Operation
A weak pseudorandom function (wPRF) is a cryptographic primitive similar to ? but weaker than ? a pseudorandom function: for wPRFs one only requires that the output is pseudorandom...
Krzysztof Pietrzak
ICDM
2007
IEEE
135views Data Mining» more  ICDM 2007»
14 years 1 months ago
Private Inference Control for Aggregate Database Queries
Data security is a critical issue for many organizations. Sensitive data must be protected from both inside and outside attackers. Access control policies and related mechanisms h...
Geetha Jagannathan, Rebecca N. Wright