Sciweavers

2200 search results - page 6 / 440
» Bloch's Constant is Computable
Sort
View
HPDC
1998
IEEE
15 years 2 months ago
Computing Twin Primes and Brun's Constant: A Distributed Approach
P. H. Fry, Jeffrey Nesheiwat, Boleslaw K. Szymansk...
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
TMC
2011
131views more  TMC 2011»
14 years 4 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
15 years 3 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano