Sciweavers

60 search results - page 12 / 12
» Zero knowledge with efficient provers
Sort
View
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
13 years 8 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
ICS
2010
Tsinghua U.
14 years 2 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
BMCBI
2004
113views more  BMCBI 2004»
13 years 4 months ago
Influence of microarrays experiments missing values on the stability of gene groups by hierarchical clustering
Background: Microarray technologies produced large amount of data. The hierarchical clustering is commonly used to identify clusters of co-expressed genes. However, microarray dat...
Alexandre G. de Brevern, Serge A. Hazout, Alain Ma...
TSP
2010
12 years 11 months ago
Variance-component based sparse signal reconstruction and model selection
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
Kun Qiu, Aleksandar Dogandzic
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 5 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...