Sciweavers

105 search results - page 3 / 21
» Verifying an Applicative ATP Using Multiset Relations
Sort
View
PEPM
2010
ACM
14 years 4 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
EDBT
2009
ACM
127views Database» more  EDBT 2009»
14 years 2 months ago
Answering aggregate keyword queries on relational databases using minimal group-bys
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
Bin Zhou 0002, Jian Pei
ICSE
2004
IEEE-ACM
14 years 7 months ago
Verifying DAML+OIL and Beyond in Z/EVES
Semantic Web, the next generation of Web, gives data well-defined and machine-understandable meaning so that they can be processed by remote intelligent agents cooperatively. Onto...
Jin Song Dong, Chew Hung Lee, Yuan-Fang Li, Hai H....
CCS
2010
ACM
13 years 7 months ago
Accountability: definition and relationship to verifiability
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...
Ralf Küsters, Tomasz Truderung, Andreas Vogt
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 8 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...