Sciweavers

105 search results - page 3 / 21
» Simple, Black-Box Constructions of Adaptively Secure Protoco...
Sort
View
GLOBECOM
2009
IEEE
13 years 9 months ago
Exploring Simulated Annealing and Graphical Models for Optimization in Cognitive Wireless Networks
In this paper we discuss the design of optimization algorithms for cognitive wireless networks (CWNs). Maximizing the perceived network performance towards applications by selectin...
Elena Meshkova, Janne Riihijärvi, Andreas Ach...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
13 years 10 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
CCS
1993
ACM
13 years 9 months ago
On Simple and Secure Key Distribution
Many recent research e orts in computer security focus on constructing provably secure authentication protocols. Although many of the resulting protocols rely on the a priori secu...
Gene Tsudik, Els Van Herreweghen
DSN
2004
IEEE
13 years 9 months ago
The Recursive NanoBox Processor Grid: A Reliable System Architecture for Unreliable Nanotechnology Devices
Advanced molecular nanotechnology devices are expected to have exceedingly high transient fault rates and large numbers of inherent device defects compared to conventional CMOS de...
A. J. KleinOsowski, Kevin KleinOsowski, Vijay Rang...
ASIACRYPT
2007
Springer
13 years 9 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...