Juan A. Garay
YOU?
Author Swipe
View article: NISQ Security and Complexity via Simple Classical Reasoning
NISQ Security and Complexity via Simple Classical Reasoning Open
We give novel lifting theorems for security games in the quantum random oracle model (QROM) in Noisy Intermediate-Scale Quantum (NISQ) settings such as the hybrid query model, the noisy oracle and the bounded-depth models. We provide, for …
View article: Robust and Verifiable MPC with Applications to Linear Machine Learning Inference
Robust and Verifiable MPC with Applications to Linear Machine Learning Inference Open
In this work, we present an efficient secure multi-party computation MPC protocol that provides strong security guarantees in settings with dishonest majority of participants who may behave arbitrarily. Unlike the popular MPC implementatio…
View article: State Machine Replication Among Strangers, Fast and Self-sufficient
State Machine Replication Among Strangers, Fast and Self-sufficient Open
View article: Improved Quantum Lifting by Coherent Measure-and-Reprogram
Improved Quantum Lifting by Coherent Measure-and-Reprogram Open
View article: Radiological Signs: The Key to Clinical Diagnosis
Radiological Signs: The Key to Clinical Diagnosis Open
Since the first years of university medical education, it was difficult to remember the names of diseases, eponyms, pathways, gyral tracts, convolutions and other neuroanatomical structures. Semiology is the branch of medicine that studies…
View article: The Bitcoin Backbone Protocol: Analysis and Applications
The Bitcoin Backbone Protocol: Analysis and Applications Open
Bitcoin is the first and most popular decentralized cryptocurrency to date. In this work, we extract and analyze the core of the Bitcoin protocol, which we term the Bitcoin backbone , and prove three of its fundamental properties which we …
View article: Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited Open
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 asynchronous setting. The primitive which allows to bypass the abov…
View article: Generalized Hybrid Search and Applications to Blockchain and Hash Function Security
Generalized Hybrid Search and Applications to Blockchain and Hash Function Security Open
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 capabilities. We then construct a hybrid quantum-classical sea…
View article: Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security
Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security Open
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 impact has been in the setting of cryptocurrencies such as…
View article: Universally Composable Almost-Everywhere Secure Computation
Universally Composable Almost-Everywhere Secure Computation Open
Most existing work on secure multi-party computation (MPC) ignores a key idiosyncrasy of modern communication networks, that there are a limited number of communication paths between any two nodes, many of which might even be corrupted. Th…
View article: Calidad microbiológica del agua de consumo humano del sector Fila alta-Jaén, 2019
Calidad microbiológica del agua de consumo humano del sector Fila alta-Jaén, 2019 Open
El estudio se realizó en el sector Fila Alta-Jaén-Cajamarca, con el objetivo de evaluar la calidad microbiológica del agua destinada al consumo humano mediante el recuento de coliformes totales (CT), coliformes termotolerantes (CTT) y bact…
View article: Post-Quantum Blockchain Proofs of Work.
Post-Quantum Blockchain Proofs of Work. Open
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 impact has been in the setting of cryptocurrencies such as…
View article: Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security
Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security Open
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 impact has been in the setting of cryptocurrencies such as…
View article: Post-Quantum Security of the Bitcoin Backbone and Quantum Multi-Solution Bernoulli Search.
Post-Quantum Security of the Bitcoin Backbone and Quantum Multi-Solution Bernoulli Search. Open
Bitcoin and its underlying blockchain protocol have recently received significant attention in the context of building distributed systems and foundations of the consensus problem. At the same time, the rapid development in quantum computi…
View article: Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup
Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup Open
View article: Special Issue: Algorithmic Tools in Cryptography
Special Issue: Algorithmic Tools in Cryptography Open
View article: The Price of Low Communication in Secure Multi-party Computation
The Price of Low Communication in Secure Multi-party Computation Open
Traditional protocols for secure multi-party computation among n parties communicate at least a linear (in n) number of bits, even when computing very simple functions. In this work we investigate the feasibility of protocols with sublinea…
View article: Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols Open
An important benchmark for multi-party computation protocols (MPC) is their round complexity. For several important MPC tasks, (tight) lower bounds on the round complexity are known. However, for some of these tasks, such as broadcast, the…
View article: Blockchain-Based Consensus (Keynote)
Blockchain-Based Consensus (Keynote) Open
Distributed consensus (aka Byzantine agreement [Pease, Shostak & Lamport, 1980]) is one of the fundamental problems in fault-tolerant distributed computing and cryptographic protocols. It requires correct participants (parties) to reach ag…
View article: Towards efficient private distributed computation on unbounded input streams
Towards efficient private distributed computation on unbounded input streams Open
In the problem of private “swarm” computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed…
View article: Fair Distributed Computation of Reactive Functions
Fair Distributed Computation of Reactive Functions Open