Sciweavers

978 search results - page 18 / 196
» Knowledge, Probability, and Adversaries
Sort
View
STOC
1998
ACM
105views Algorithms» more  STOC 1998»
13 years 11 months ago
Concurrent Zero-Knowledge
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
Cynthia Dwork, Moni Naor, Amit Sahai
ICDCS
2007
IEEE
14 years 1 months ago
Temporal Privacy in Wireless Sensor Networks
Although the content of sensor messages describing “events of interest” may be encrypted to provide confidentiality, the context surrounding these events may also be sensitiv...
Pandurang Kamat, Wenyuan Xu, Wade Trappe, Yanyong ...
FLAIRS
1998
13 years 8 months ago
Propagating Probabilities in System P
In this paper wesuggest a wayof using the rules of System P to propagate lower bounds on conditional probabilities. Usinga knowledgebase of default rules whichart, consideredto be...
Rachel A. Bourne, Simon Parsons
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 8 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim
ACL
2003
13 years 8 months ago
A Probability Model to Improve Word Alignment
Word alignment plays a crucial role in statistical machine translation. Word-aligned corpora have been found to be an excellent source of translation-related knowledge. We present...
Colin Cherry, Dekang Lin