Sciweavers

769 search results - page 48 / 154
» Where Is the Proof
Sort
View
JCT
2007
94views more  JCT 2007»
13 years 8 months ago
A zero-free interval for flow polynomials of cubic graphs
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
Bill Jackson
ECCC
2011
234views ECommerce» more  ECCC 2011»
13 years 3 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
EUROCRYPT
1999
Springer
14 years 1 months ago
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Distributed key generation is a main component of threshold cryptosystems and distributed cryptographic computing in general. Solutions to the distributed generation of private key...
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk,...
PODC
2009
ACM
14 years 9 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
ESORICS
2003
Springer
14 years 2 months ago
Symmetric Authentication within a Simulatable Cryptographic Library
Abstract. Proofs of security protocols typically employ simple abstractions of cryptographic operations, so that large parts of such proofs pendent of cryptographic details. The ty...
Michael Backes, Birgit Pfitzmann, Michael Waidner