4 citations · 4 across the 5 of their papers we have counts for
5 papers
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited
Ran Cohen, Pouyan Forghani, Juan Garay +2
It is well known that without randomization, Byzantine agreement (BA) requires a linear number of rounds in the synchronous setting, while it is flat out impossible in the asynchro…
Generalized Hybrid Search and Applications to Blockchain and Hash Function Security
Alexandru Cojocaru, Juan Garay, Fang Song
In this work we first examine the hardness of solving various search problems by hybrid quantum-classical strategies, namely, by algorithms that have both quantum and classical cap…
Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security
Alexandru Cojocaru, Juan Garay, Aggelos Kiayias +2
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. Arguably, its main…
Efficient Private Distributed Computation on Unbounded Input Streams
Shlomi Dolev, Juan Garay, Niv Gilboa +2
In the problem of swarm computing, agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of s…
Mutual Search
Harry Buhrman, Matthew Franklin, Juan A. Garay +3
We introduce a search problem called ``mutual search'' where \agents, arbitrarily distributed over sites, are required to locate one another by posing queries of the form `…