Sciweavers

145 search results - page 29 / 29
» Adversarial learning
Sort
View
WPES
2003
ACM
14 years 26 days ago
Reusable anonymous return channels
Mix networks are used to deliver messages anonymously to recipients, but do not straightforwardly allow the recipient of an anonymous message to reply to its sender. Yet the abili...
Philippe Golle, Markus Jakobsson
ACMACE
2009
ACM
14 years 9 days ago
Critical gameplay
How do games effect the way we problem solve, socialize, or even view the world? When we shoot do we learn to destroy obstacles instead of work around them? Does the binary world ...
Lindsay Grace
ACL
2003
13 years 9 months ago
Recognizing Expressions of Commonsense Psychology in English Text
Many applications of natural language processing technologies involve analyzing texts that concern the psychological states and processes of people, including their beliefs, goals...
Andrew Gordon, Abe Kazemzadeh, Anish Nair, Milena ...
ASIACRYPT
2011
Springer
12 years 7 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
CRYPTO
2011
Springer
207views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Secure Computation on the Web: Computing without Simultaneous Interaction
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
Shai Halevi, Yehuda Lindell, Benny Pinkas