Efficient Reductions for Non-signaling Cryptographic Primitives

被引:0
|
作者
Doettling, Nico [1 ]
Kraschewski, Daniel [1 ]
Mueller-Quade, Joern [1 ]
机构
[1] Karlsruhe Inst Technol, Fac Informat, Inst Cryptog & Secur, D-76021 Karlsruhe, Germany
关键词
Statistical Security; Efficient Reductions; One-Time Memories; Non-local Boxes; QUANTUM NONLOCALITY; COMPUTATION; CODES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Tamper-proof devices, especially one-time memories (OTMs), are very powerful primitives. They can, e.g., implement one-time 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.
引用
收藏
页码:120 / 137
页数:18
相关论文
共 50 条
  • [1] Non-Signaling Parallel Repetition Using de Finetti Reductions
    Arnon-Friedman, Rotem
    Renner, Renato
    Vidick, Thomas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (03) : 1440 - 1457
  • [2] Energy-Efficient Cryptographic Primitives
    Miller, D. Michael
    Sasao, Tsutomu
    FACTA UNIVERSITATIS-SERIES ELECTRONICS AND ENERGETICS, 2018, 31 (02) : I - III
  • [3] Efficient Cryptographic Primitives for Private Data Mining
    Shaneck, Mark
    Kim, Yongdae
    43RD HAWAII INTERNATIONAL CONFERENCE ON SYSTEMS SCIENCES VOLS 1-5 (HICSS 2010), 2010, : 917 - +
  • [4] New class of the FPGA efficient cryptographic primitives
    Moldovyan, NA
    Eremeev, MA
    Sklavos, N
    Koufopavlou, O
    2004 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 2, PROCEEDINGS, 2004, : 553 - 556
  • [5] THE COMMUNICATION COMPLEXITY OF NON-SIGNALING DISTRIBUTIONS
    Degorre, Julien
    Kaplan, Marc
    Laplante, Sophie
    Roland, Jeremie
    QUANTUM INFORMATION & COMPUTATION, 2011, 11 (7-8) : 649 - 676
  • [6] The Communication Complexity of Non-signaling Distributions
    Degorre, Julien
    Kaplan, Marc
    Laplante, Sophie
    Roland, Jeremie
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 270 - +
  • [7] The impossibility of non-signaling privacy amplification
    Haenggi, Esther
    Renner, Renato
    Wolf, Stefan
    THEORETICAL COMPUTER SCIENCE, 2013, 486 : 27 - 42
  • [8] Cryptographic primitives
    Garrett, P
    PUBLIC-KEY CRYPTOGRAPHY, 2005, 62 : 1 - 62
  • [9] Non-signaling boxes and quantum logics
    Tylec, T. I.
    Kus, M.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2015, 48 (50)
  • [10] Testing Linearity against Non-Signaling Strategies
    Chiesa, Alessandro
    Manohar, Peter
    Shinkar, Igor
    33RD COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2018), 2018, 102