Sciweavers

91 search results - page 17 / 19
» Multiparty Communication Complexity of Disjointness
Sort
View
CCS
2007
ACM
14 years 1 months ago
Privacy preserving error resilient dna searching through oblivious automata
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
Juan Ramón Troncoso-Pastoriza, Stefan Katze...
25
Voted
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
14 years 1 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 23 hour ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
ASIACRYPT
2001
Springer
14 years 1 days ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
13 years 9 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola