Sciweavers

19 search results - page 4 / 4
» jacm 2007
Sort
View
JACM
2007
84views more  JACM 2007»
13 years 6 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
JACM
2010
137views more  JACM 2010»
13 years 4 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
PKC
2007
Springer
100views Cryptology» more  PKC 2007»
14 years 12 days ago
Multi-bit Cryptosystems Based on Lattice Problems
Abstract. We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwass...
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
13 years 10 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky