Sciweavers

164 search results - page 33 / 33
» Covert two-party computation
Sort
View
PODC
2009
ACM
14 years 6 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
OZCHI
2009
ACM
14 years 1 months ago
Towards an ethical interaction design: the issue of including stakeholders in law-enforcement software development
In the public sector (particularly in the UK in light of recent reforms i.e. the Local Government Act 2000, etc.) a greater degree of accountability and public involvement or inte...
Patrick G. Watson, Penny Duquenoy, Margaret Brenna...
DSN
2009
IEEE
14 years 1 months ago
On the effectiveness of structural detection and defense against P2P-based botnets
Recently, peer-to-peer (P2P) networks have emerged as a covert communication platform for malicious programs known as bots. As popular distributed systems, they allow bots to comm...
Duc T. Ha, Guanhua Yan, Stephan Eidenbenz, Hung Q....
ENTCS
2006
1305views more  ENTCS 2006»
13 years 6 months ago
Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions
Conventional approaches to the modeling of autonomous agents and agent communication rely heavily on the ascription of mental properties like beliefs and intentions to the individ...
Matthias Nickles, Felix A. Fischer, Gerhard Wei&sz...