Sciweavers

47 search results - page 6 / 10
» The Cost of the Missing Bit: Communication Complexity with H...
Sort
View
JSW
2007
97views more  JSW 2007»
13 years 7 months ago
Instantiation of a Classification System Framework that Facilitates Reuse
Abstract—Frameworks are a key technology to reduce software development costs and shorten the time-to-market. However, framework complexity presents reuse problems that limit its...
Sérgio F. Lopes, Adriano Tavares, Joã...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
CASES
2003
ACM
14 years 21 days ago
Encryption overhead in embedded systems and sensor network nodes: modeling and analysis
Recent research in sensor networks has raised issues of security for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices...
Ramnath Venugopalan, Prasanth Ganesan, Pushkin Ped...
WSNA
2003
ACM
14 years 21 days ago
Analyzing and modeling encryption overhead for sensor network nodes
Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices in...
Prasanth Ganesan, Ramnath Venugopalan, Pushkin Ped...
EUROCRYPT
2008
Springer
13 years 9 months ago
Isolated Proofs of Knowledge and Isolated Zero Knowledge
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...