Sciweavers

26 search results - page 3 / 6
» An epistemic characterization of zero knowledge
Sort
View
LICS
2007
IEEE
13 years 11 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam
AAAI
1990
13 years 6 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
13 years 8 months ago
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
Rafail Ostrovsky
FM
1999
Springer
93views Formal Methods» more  FM 1999»
13 years 9 months ago
Group Principals and the Formalization of Anonymity
We introduce the concept of a group principal and present a number of different classes of group principals, including threshold-group-principals. These appear to naturally usefu...
Paul F. Syverson, Stuart G. Stubblebine
PODS
2008
ACM
174views Database» more  PODS 2008»
14 years 5 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...