Sciweavers

813 search results - page 28 / 163
» On the interaction between sharing and linearity
Sort
View
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
15 years 4 months ago
Characterizing Ideal Weighted Threshold Secret Sharing
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive w...
Amos Beimel, Tamir Tassa, Enav Weinreb
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
13 years 1 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
FOCS
2008
IEEE
15 years 9 days ago
Quantum Multi Prover Interactive Proofs with Communicating Provers
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
BMCBI
2004
207views more  BMCBI 2004»
14 years 11 months ago
Computational identification of transcription factor binding sites by functional analysis of sets of genes sharing overrep-resen
Background: Transcriptional regulation is a key mechanism in the functioning of the cell, and is mostly effected through transcription factors binding to specific recognition moti...
Davide Corà, Ferdinando Di Cunto, Paolo Pro...
BMVC
2010
14 years 9 months ago
High Five: Recognising human interactions in TV shows
In this paper we address the problem of recognising interactions between two people in realistic scenarios for video retrieval purposes. We develop a per-person descriptor that us...
Alonso Patron, Marcin Marszalek, Andrew Zisserman,...