Sciweavers

978 search results - page 64 / 196
» Knowledge, Probability, and Adversaries
Sort
View
JCSS
2008
120views more  JCSS 2008»
15 years 5 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
IJAR
2006
103views more  IJAR 2006»
15 years 5 months ago
Computing mean and variance under Dempster-Shafer uncertainty: Towards faster algorithms
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
Vladik Kreinovich, Gang Xiang, Scott Ferson
SPAA
2009
ACM
16 years 6 months ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...
WPES
2006
ACM
15 years 11 months ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle
CHES
2010
Springer
214views Cryptology» more  CHES 2010»
15 years 7 months ago
Correlation-Enhanced Power Analysis Collision Attack
Side-channel based collision attacks are a mostly disregarded alternative to DPA for analyzing unprotected implementations. The advent of strong countermeasures, such as masking, h...
Amir Moradi, Oliver Mischke, Thomas Eisenbarth