Sciweavers

273 search results - page 26 / 55
» Mutually Independent Commitments
Sort
View
ICMLA
2008
14 years 11 months ago
Semi-supervised IFA with Prior Knowledge on the Mixing Process: An Application to a Railway Device Diagnosis
Independent Factor Analysis (IFA) is a well known method used to recover independent components from their linear observed mixtures without any knowledge on the mixing process. Su...
Etienne Côme, Zohra Leila Cherfi, Latifa Ouk...
PODC
2011
ACM
14 years 15 days ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
TIT
2008
105views more  TIT 2008»
14 years 8 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
15 years 10 months ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
61
Voted
CTRSA
2009
Springer
95views Cryptology» more  CTRSA 2009»
15 years 4 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