Sciweavers

184 search results - page 18 / 37
» Querying Proofs
Sort
View
FSE
2007
Springer
105views Cryptology» more  FSE 2007»
14 years 1 months ago
New Bounds for PMAC, TMAC, and XCBC
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were σ2 /2n , where n is the block size in bits ...
Kazuhiko Minematsu, Toshiyasu Matsushima
MSV
2004
13 years 8 months ago
Towards Quality of Service Based Resource Management for Cluster-Based Image Database
The main research in the area of image databases addresses the improvement of retrieval quality and the speedup of the query processing. A number of image retrieval systems reache...
Andreas Brüning, Frank Drews, Martin Hoefer, ...
CP
2010
Springer
13 years 5 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 7 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
DASFAA
2006
IEEE
134views Database» more  DASFAA 2006»
14 years 1 months ago
Authentication of Outsourced Databases Using Signature Aggregation and Chaining
Database outsourcing is an important emerging trend which involves data owners delegating their data management needs to an external service provider. Since a service provider is a...
Maithili Narasimha, Gene Tsudik