Efficient reductions for non-signaling cryptographic primitives

Authors:
Nico Döttling;Daniel Kraschewski;Jörn Müller-Quade
Affiliations:
Institute of Cryptography and Security, Faculty of Informatics, Karlsruhe Institute of Technology, Germany;Institute of Cryptography and Security, Faculty of Informatics, Karlsruhe Institute of Technology, Germany;Institute of Cryptography and Security, Faculty of Informatics, Karlsruhe Institute of Technology, Germany
Venue:
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Year:
2011

Citing 12
Cited 1

A randomized protocol for signing contracts

Communications of the ACM
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Physics of No-Bit-Commitment: Generalized Quantum Non-Locality Versus Oblivious Transfer

Quantum Information Processing
Secure Computation from Random Error Correcting Codes

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
One-Time Programs

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Founding cryptography on tamper-proof hardware tokens

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On codes, matroids and secure multi-party computation from linear secret sharing schemes

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Expander codes

IEEE Transactions on Information Theory - Part 1
Oblivious transfers and intersecting codes

IEEE Transactions on Information Theory - Part 1
On expander codes

IEEE Transactions on Information Theory
Linear-time encodable/decodable codes with near-optimal rate

IEEE Transactions on Information Theory

Statistically secure linear-rate dimension extension for oblivious affine function evaluation

ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tamper-proof devices, especially one-time memories (OTMs), are very powerful primitives. They can, e.g., implement onetime programs, i.e. circuits that can be evaluated only once. Furthermore they exhibit a non-signaling nature: The issuer of the device cannot tell whether the receiver interacted with the device. However, due to this non-signaling property, it is non-trivial to obtain protocols with a clear defined end from such devices. The main contribution of this paper is a significant improvement of previous reductions from oblivious transfer to OTMs. The most extreme primitive with respect to non-signaling is the so called non-local box (NL-Box), where neither the sender nor the receiver get to know if the respective other party has interacted with the NL-Box. We show that OTMs can securely be implemented from NL-Boxes. To the best of our knowledge this is the first protocol to cancel the non-signaling property of an NL-Box for exactly one party.