Sciweavers

4498 search results - page 347 / 900
» How to Invent Functions
Sort
View
EUROCRYPT
2001
Springer
15 years 10 months ago
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
Yevgeniy Dodis, Amit Sahai, Adam Smith
DEXA
1999
Springer
87views Database» more  DEXA 1999»
15 years 10 months ago
SECONDO/QP: Implementation of a Generic Query Processor
: In an extensible database system, evaluation of a query plan is done in cooperation between a collection of operator implementation functions and a component of the DBMS that we ...
Ralf Hartmut Güting, Stefan Dieker, Claudia F...
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
15 years 10 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan
ESWS
2007
Springer
15 years 10 months ago
Imprecise SPARQL: Towards a Unified Framework for Similarity-Based Semantic Web Tasks
This proposal explores a unified framework to solve Semantic Web tasks that often require similarity measures, such as RDF retrieval, ontology alignment, and semantic service match...
Christoph Kiefer
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam