NDLI: Building one-time memories from isolated qubits: (extended abstract)

Please wait, while we are loading the content...

Lattice-based FHE as secure as PKE

On the structure of boolean functions with small spectral norm

Invitation games and the price of stability

Private interactive communication across an adversarial channel

Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements

Black-box obfuscation for d-CNFs

Attribute-efficient evolvability of linear functions

Testers and their applications

Deterministic compression with uncertain priors

Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems

Decompositions of triangle-dense graphs

Direct sum fails for zero error average communication

Cryptogenography

Non-commutative arithmetic circuits with division

The computational hardness of pricing compound options

Tree codes and a conjecture on exponential sums

Sequential decision making with vector outcomes

Candidate weak pseudorandom functions in $AC^{0}$ ○ $MOD_{2}$

An efficient algorithm for finding the ground state of 1D gapped local hamiltonians

Expanders with respect to Hadamard spaces and random graphs: extended abstract

Faster private release of marginals on small databases

Complexity of approximating CSP with balance / hard constraints

Partial tests, universal tests and decomposability

Rational arguments: single round delegation with sublinear verification

Limits of random oracles in secure computation

Decision trees, protocols and the entropy-influence conjecture

Welfare maximization and truthfulness in mechanism design with ordinal preferences

Capacity of non-malleable codes

Learning mixtures of arbitrary distributions over large discrete domains

Iterated group products and leakage resilience against NC1

Energy-efficient circuit design

On the automorphism groups of strongly regular graphs I

Mechanism design in large games: incentives and privacy

Integer feasibility of random polytopes: random integer programs

High dimensional expanders and property testing

Optimal provision-after-wait in healthcare

Robust device independent quantum key distribution

Locally testable codes and cayley graphs

Coordination mechanisms from (almost) all scheduling policies

Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications

Why do simple algorithms for triangle enumeration work in the real world?

Building one-time memories from isolated qubits: (extended abstract)

Rate-independent computation in continuous chemical reaction networks

Limits of local algorithms over sparse random graphs

Redrawing the boundaries on purchasing data from privacy-sensitive individuals

Multireference alignment using semidefinite programming

Parameterized testability

The truth behind the myth of the folk theorem

Building one-time memories from isolated qubits: (extended abstract)

Content Provider	ACM Digital Library
Author	Liu, Yi-Kai
Abstract	One-time memories (OTM's) are simple tamper-resistant cryptographic devices, which can be used to implement one-time programs, a very general form of software protection and program obfuscation. Here we investigate the possibility of building OTM's using quantum mechanical devices. It is known that OTM's cannot exist in a fully-quantum world or in a fully-classical world. Instead, we propose a new model based on isolated qubits - qubits that can only be accessed using local operations and classical communication (LOCC). This model combines a quantum resource (single-qubit measurements) with a classical restriction (on communication between qubits), and can be implemented using current technologies, such as nitrogen vacancy centers in diamond. In this model, we construct OTM's that are information-theoretically secure against one-pass LOCC adversaries that use 2-outcome measurements. Our construction resembles Wiesner's old idea of quantum conjugate coding, implemented using random error-correcting codes; our proof of security uses entropy chaining to bound the supremum of a suitable empirical process. In addition, we conjecture that our random codes can be replaced by some class of efficiently-decodable codes, to get computationally-efficient OTM's that are secure against computationally-bounded LOCC adversaries. In addition, we construct data-hiding states, which allow an LOCC sender to encode an (n-O(1))-bit messsage into n qubits, such that at most half of the message can be extracted by a one-pass LOCC receiver, but the whole message can be extracted by a general quantum receiver.
Starting Page	269
Ending Page	286
Page Count	18
File Format	PDF
ISBN	9781450326988
DOI	10.1145/2554797.2554823
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-01-12
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Quantum computation Conjugate coding One-time programs Data-hiding states Cryptography Oblivious transfer Local operations and classical communication
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in