29 search results - page 4 / 6 » Homomorphic Signatures for Polynomial Functions |
PODS
2008
ACM
14 years 7 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
IFL
2001
Springer
14 years 2 days ago
2001
Springer
Abstract. This paper is an extension of a previous work where two nondeterminism analyses were presented. One of them was efficient but not very powerful and the other one was more...
IACR
2011
12 years 7 months ago
2011
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
CSFW
2007
IEEE
14 years 2 months ago
2007
IEEE
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
EUROCRYPT
2010
Springer
14 years 13 days ago
2010
Springer
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...