Sciweavers

915 search results - page 81 / 183
» Proof labeling schemes
Sort
View
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
CTRSA
2009
Springer
95views Cryptology» more  CTRSA 2009»
14 years 2 months ago
Statistically Hiding Sets
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables a prover to commit a set to a verifier, without revealing even the size of the...
Manoj Prabhakaran, Rui Xue
LATA
2009
Springer
14 years 2 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
IFIP
2009
Springer
14 years 2 months ago
A Calculus of Trustworthy Ad Hoc Networks
We propose a process calculus for mobile ad hoc networks which embodies a behaviour-based multilevel decentralised trust model. Our trust model supports both direct trust, by monit...
Massimo Merro, Eleonora Sibilio