Discrimination by Gender and Disability Status: Do Worker Perceptions Match Statistical Measures?

We explore whether perceptions of discrimination are related to ordinary statistical measures. The majority of disabled respondents report feeling some discrimination due to their disability, the majority of women feel some discrimination because of their gender, and a surprising number of men also report some discrimination. We do not find a strong link between perceptions of discrimination and measured discrimination perhaps because those who perceive discrimination feel that it occurs along other dimensions than pay. However, we do find a connection between whether a person feels his or her income is inadequate and measured discrimination for all groups studied

Quantum Fully Homomorphic Encryption With Verification

Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantum setting. However, a crucial ingredient in almost all applications of FHE is circuit verification. Classically, verification is performed by checking a transcript of the homomorphic computation. Quantumly, this strategy is impossible due to no-cloning. This leads to an important open question: can quantum computations be delegated and verified in a non-interactive manner? In this work, we answer this question in the affirmative, by constructing a scheme for QFHE with verification (vQFHE). Our scheme provides authenticated encryption, and enables arbitrary polynomial-time quantum computations without the need of interaction between client and server. Verification is almost entirely classical; for computations that start and end with classical states, it is completely classical. As a first application, we show how to construct quantum one-time programs from classical one-time programs and vQFHE.Comment: 30 page

Unconditionally verifiable blind computation

Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the server has followed the instructions of the protocol, or if there has been some deviation resulting in a corrupted output state. A verifiable BQC protocol can be viewed as an interactive proof system leading to consequences for complexity theory. The authors, together with Broadbent, previously proposed a universal and unconditionally secure BQC scheme where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. In this paper we extend that protocol with new functionality allowing blind computational basis measurements, which we use to construct a new verifiable BQC protocol based on a new class of resource states. We rigorously prove that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter. The new resource state allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead. This is a significant improvement on the original scheme, which required that all computations to be performed must first be put into a nearest neighbour form, incurring linear overhead in the number of qubits. Such an improvement has important consequences for efficiency and fault-tolerance thresholds.Comment: 46 pages, 10 figures. Additional protocol added which allows arbitrary circuits to be verified with polynomial securit

Unforgeable Quantum Encryption

We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect adversarial cheating in such scenarios. Quantumly, this approach would violate no-cloning. We develop new techniques to overcome this problem: we use entanglement to detect cheating, and rely on recent results for characterizing quantum encryption schemes. We give definitions for (i.) ciphertext unforgeability , (ii.) indistinguishability under adaptive chosen-ciphertext attack, and (iii.) authenticated encryption. The restriction of each definition to the classical setting is at least as strong as the corresponding classical notion: (i) implies INT-CTXT, (ii) implies IND-CCA2, and (iii) implies AE. All of our new notions also imply QIND-CPA privacy. Combining one-time authentication and classical pseudorandomness, we construct schemes for each of these new quantum security notions, and provide several separation examples. Along the way, we also give a new definition of one-time quantum authentication which, unlike all previous approaches, authenticates ciphertexts rather than plaintexts.Comment: 22+2 pages, 1 figure. v3: error in the definition of QIND-CCA2 fixed, some proofs related to QIND-CCA2 clarifie

Rotational 3D Printing of Sensor Devices using Reactive Ink Chemistries

This paper charts progress in three key areas of a project supported by both UK government and UK industry to manufacture novel sensor devices using rotary 3D printing technology and innovative ink chemistries; (1) the development of an STL file slicing algorithm that returns constant Z height 2D contour data at a resolution that matches the given print head setup, allowing digital images to be generated of the correct size without the need for scaling; (2) the development of image transformation algorithms which allow images to be printed at higher resolutions using tilted print heads and; (3) the formulation of multi part reaction inks which combine and react on the substrate to form solid material layers with a finite thickness. A Direct Light Projection (DLP) technique demonstrated the robustness of the slice data by constructing fine detailed three dimensional test pieces which were comparable to identical parts built in an identical way from slice data obtained using commercial software. Material systems currently under investigation include plaster, stiff polyamides and epoxy polymers and conductive metallic’s. Early experimental results show conductivities of silver approaching 1.42x105 Siemens/m.Mechanical Engineerin

Zero-Knowledge Proof Systems for QMA

© 2016 IEEE. Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness assumptions for quantum computations, these proof systems can be made secure against quantum attacks. We prove a result representing a further quantum generalization of this fact, which is that every problem in the complexity class QMA has a quantum zero-knowledge proof system. More specifically, assuming the existence of an unconditionally binding and quantum computationally concealing commitment scheme, we prove that every problem in the complexity class QMA has a quantum interactive proof system that is zero-knowledge with respect to efficient quantum computations. Our QMA proof system is sound against arbitrary quantum provers, but only requires an honest prover to perform polynomial-time quantum computations, provided that it holds a quantum witness for a given instance of the QMA problem under consideration

A Fully Decentralized Hierarchical Transactive Energy Framework for Charging EVs with Local DERs in Power Distribution Systems

The penetration rates of both electric vehicles (EVs) and distributed energy resources (DERs) have been increasing rapidly as appealing options to address the global problems of carbon emissions and fuel supply issues. However, uncoordinated EV charging activities and DER generation result in operational challenges for power distribution systems. Therefore, this article has developed a hierarchical transactive energy (TE) framework to locally induce and coordinate EV charging demand and DER generation in electric distribution networks. Based on a modified version of the alternating direction method of multipliers (ADMMs), two fully decentralized (DEC) peer-to-peer (P2P) trading models are presented, that is, an hour-ahead market and a 5-min-ahead real-time market. Compared to existing P2P electricity markets, this research represents the first attempt to comprehensively incorporate alternating current (ac) power network constraints into P2P electricity trading. The proposed TE framework not only contributes to mitigating operational challenges of distribution systems, but also benefits both EV owners and DER investors through secured local energy transactions. The privacy of market participants is well preserved since the bid data of each participant are not exposed to others. Comprehensive simulations based on the IEEE 33-node distribution system are conducted to demonstrate the feasibility and effectiveness of the proposed method

Iterated gate teleportation and blind quantum computation

Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement blind computation, and a bound based on the no-programming theorem of Nielsen and Chuang has emerged as a natural limiting factor. Here we show that this constraint only holds in limited scenarios, and show how to overcome it using a novel method of iterated gate teleportations. This technique enables drastic reductions in the communication required for distributed quantum protocols, extending beyond the blind computation setting. Applied to blind quantum computation, this technique offers significant efficiency improvements, and in some scenarios offers an exponential reduction in communication requirements

Quantum authentication with key recycling

We show that a family of quantum authentication protocols introduced in [Barnum et al., FOCS 2002] can be used to construct a secure quantum channel and additionally recycle all of the secret key if the message is successfully authenticated, and recycle part of the key if tampering is detected. We give a full security proof that constructs the secure channel given only insecure noisy channels and a shared secret key. We also prove that the number of recycled key bits is optimal for this family of protocols, i.e., there exists an adversarial strategy to obtain all non-recycled bits. Previous works recycled less key and only gave partial security proofs, since they did not consider all possible distinguishers (environments) that may be used to distinguish the real setting from the ideal secure quantum channel and secret key resource.Comment: 38+17 pages, 13 figures. v2: constructed ideal secure channel and secret key resource have been slightly redefined; also added a proof in the appendix for quantum authentication without key recycling that has better parameters and only requires weak purity testing code