pydoop pydoop.sourceforge.net

Apache Pulsar (incubating) pulsar.incubator.apache.org

Oozie Eclipse Plugin marketplace.eclipse.org

Hadoop in Action, Second Edition manning.com

Hadoop in Practice, Second Edition manning.com

Luigi luigi.readthedocs.org

Logit.io logit.io

Apache Lens lens.apache.org

Apache Kylin kylin.incubator.apache.org

Apache Impala impala.apache.org

Apache Hivemall (incubating) hivemall.incubator.apache.org

Apache HAWQ (incubating) hawq.incubator.apache.org

Hadoop Weekly hadoopweekly.com

Hadoop illuminated hadoopilluminated.com

The Hadoop Ecosystem Table hadoopecosystemtable.github.io

Hadoop360 hadoop360.com

Apache Hadoop Ozone hadoop.apache.org

RHadoop github.com

Ganglia Monitoring System ganglia.sourceforge.net

GIS Tools for Hadoop esri.github.io

Apache Druid (incubating) druid.incubator.apache.org

DataWorks Summit dataworkssummit.com

Apache DataFu datafu.incubator.apache.org

Spark Summit databricks.com

Strata + Hadoop World conferences.oreilly.com

AWS BigData Blog blogs.aws.amazon.com

BigDL bigdl-project.github.io

Apache Atlas atlas.incubator.apache.org

Apache Apex (incubating) apex.incubator.apache.org

ApacheCon apachecon.com

Hadoop Operations amazon.com

Hadoop: The Definitive Guide amazon.com

Apache Hadoop Yarn amazon.com

Tagging systems (2006) patents.google.com

Introduces QPV under the name of 'quantum tagging'.

Position-based quantum cryptography and catalytic computation (2016) eprints.illc.uva.nl

Chapter 5 independently generalises BB84 QPV to more input bases. Chapter 4 provides an efficient attack on the protocol based on interleaved unitaries.

Instantaneous non-local computation of low T-depth quantum circuits (2016) doi.org

Provides a general attack on QPV using an exponential amount of pre-shared EPR pairs in the number of T-gates or T-depth based on the circuit decomposition of the task unitary into Clifford+T gates.

Beating classical impossibility of position verification (2022) doi.org

Constructs a QPV protocol with only classical input and output information from the assumption that LWE is quantum-hard. Shows unconditional security in the random oracle model.

Relating non-local quantum computation to information theoretic cryptography (2023) doi.org

Connects $f$-routing to topics in classical cryptography, in particular conditional disclosure of secrets. Shows a sub-exponential upper bound for attacks for any $f$ and finds an $f$ that is believed to be outside of $\mathsf{P}$ (with pre-processing), but efficiently attacked.

Code-routing: A new attack on position verification (2023) doi.org

Provides a new attack on $f$-routing, connecting attacks to secret-sharing schemes and span programs, and showing that any $f \in \mathsf{Mod}_p\mathsf{L}$ (with pre-processing), for $p$ prime, can be attacked efficiently.

Complexity and entanglement in non-local computation and holography (2022) doi.org

Notes that the necessary attack resource requirements are controlled by the entangled part of the task unitary. Shows that for tasks where one side is classical input information, a doubly-logarithmic (later improved to logarithmic) lower bound and exponential upper bound (in…

The garden-hose model (2013) doi.org

Studies attacks on $f$-routing and introduces garden-hose complexity to connect attacks on $f$-routing to complexity theory. Provides many first results regarding that connection, for example that any $f \in \mathsf{L}$ (with pre-processing) can be attacked efficiently.

Position-based quantum cryptography: Impossibility and constructions (2011) doi.org

Shows security against unentangled attacks.

Bounds on instantaneous non-local quantum computation (2020) doi.org

Shows that any 2-qubit unitary can be attacked up to error $\varepsilon$ using $\log(1/\varepsilon)$ EPR pairs and that any hermitian bipartite binary controlled unitary can be attacked with 1 EPR pair. Shows logarithmic lower bound on entanglement entropy for general bipartite…

Quantum location verification in noisy channels (2010) doi.org

Studies QPV based on Bell states, GHZ states and entanglement swapping. Studies the effect of noise/decoherence.

Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers (2023) doi.org

Tightly characterises the secure region of the protocol depending on the loss and error rates.

Loss-tolerant quantum secure positioning with weak laser sources (2016) doi.org

Studies a version of the protocol with separable inputs. Proves full loss tolerance and studies practical implementation based on decoy states.

Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation (2016) doi.org

Shows that if attackers share PR boxes, then any unitary can be attacked using only linear entanglement and a linear number of PR box uses.

Practical position-based quantum cryptography (2015) doi.org

Considers the case where the two input bases are related by a unitary $U$.

Loss-tolerant position-based quantum cryptography (2015) doi.org

Generalises BB84 QPV to more input bases and notes better loss tolerance properties because of it. Also discusses using decoy states and continuous variables for BB84 QPV.

Quantum tagging for tags containing secret classical data (2011) doi.org

Considers QPV in the setting when the verifiers and the prover pre-share a secret. Shows that then QPV is unconditionally secure by indefinitely expanding the secret using QKD.