Sciweavers

3228 search results - page 448 / 646
» Computationally Sound Proofs
Sort
View
EKAW
1999
Springer
15 years 7 months ago
Formally Verifying Dynamic Properties of Knowledge Based Systems
Abstract. In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-ba...
Perry Groot, Annette ten Teije, Frank van Harmelen
EUROCRYPT
1998
Springer
15 years 7 months ago
A Formal Treatment of Remotely Keyed Encryption
Remotely keyed encryption schemes (RKESs), introduced by Blaze 6], support high-bandwidth cryptographic applications (such as encrypted video conferences) in which long-lived secre...
Matt Blaze, Joan Feigenbaum, Moni Naor
125
Voted
QCQC
1998
Springer
115views Communications» more  QCQC 1998»
15 years 7 months ago
Quantum Entanglement and the Communication Complexity of the Inner Product Function
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
Richard Cleve, Wim van Dam, Michael Nielsen, Alain...
116
Voted
CSFW
1996
IEEE
15 years 7 months ago
An Immunological Approach to Change Detection: Theoretical Results
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...
Patrik D'haeseleer
172
Voted
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 7 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan