DOCSLIB.ORG

New Implications and Improved Efficiency of Constructions Based on One-Way Functions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
New Implications and Improved Efficiency of Constructions Based on One-Way Functions חבור לשם קבלת התואר Thesis for the degree דוקטור לפילוסופיה Doctor of Philosophy מאת By יפתח הייטנר Iftach Haitner New Implications and Improved Efficiency of Constructions Based on One-way Functions יישומים חדשים ובניות יעילות מבוססות פונקציות חד כיווניות מנחה Advisor פרופ' עמר ריינגולד Prof. Omer Reingold אדר א' תשס"ח March 2008 מוגש למועצה המדעית של Submitted to the Scientific Council of the מכון ויצמן למדע Weizmann Institute of Science רחובות, ישראל Rehovot, Israel To my father, Moti Haitner, who knew little about Science, but much about what it takes to be a Human Being. Summary Since most interesting cryptographic tasks are impossible to achieve with absolute, information- theoretic security, modern cryptography aims to design cryptographic primitives (i.e., algo- rithms/protocols) that are computationally infeasible to break (i.e., secure against computationally bounded adversaries). Proving lower bounds of the type needed, however, seems beyond the reach of current techniques in complexity theory. 1 Thus, research in the Foundations of Cryptography has aimed to design primitives based on complexity assumptions that are as weak as possible. It is well known that the assumption that one-way functions exist, is necessary for most cryptographic primitives. It is then natural to pose the opposite question. Namely, does the existence of one-way functions imply the existence of all cryptographic primitives? Here we consider some of the most fundamental primitives in cryptography and prove the following results about the power of one-way functions in implementing these primitives. Statistically hiding commitments. Statistically hiding commitments (ones where the hiding property holds against even computationally unbounded adversaries) are among the few fun- damental primitives for which we have failed to ¯nd exact characterization. That is, until recently it was only known how to build these primitives from seemingly stronger assumptions than the existence of one-way functions, yet there was no black-box separation between these primitives and one-way functions. We resolve the complexity of statistically hiding commitments, giving a construction of statis- tically hiding commitment schemes under the minimal complexity assumption that one-way functions exist. By this we give a positive answer to an open question posed by Naor, Ostro- vsky, Venkatesan, and Yung (CRYPTO `92, J. Cryptology `98). Pseudorandom generators. We present a construction of pseudorandom generators based on regular one-way functions that is signi¯cantly better (in terms of security and e±ciency) than the previous construction of Goldreich, Krawczyk and Luby (FOCS '88, SIAM J. on Computing '99) (i.e., the input length of our generator is £(n log n) compared to £(n3) in Goldreich et al., where n is the input length of the underlying one-way function). In addi- tion, we present a construction of pseudorandom generators from any one-way function that improves the construction of Hºastad,Impagliazzo, Levin and Luby (STOC '89, STOC '90, SIAM J. on Computing '99). Finally, we show a rather e±cient construction of pseudorandom generator (input length £(n2)) based on one-way functions with exponential hardness. Our construction signi¯cantly improves the previous construction due to Holenstein (TCC '06) (input length £(n5)). 1Indeed, it would require at least proving that P 6= NP. i Summary Summary Interactive hashing. We give an alternative proof for interactive hashing protocol of Naor, Os- trovsky, Venkatesan and Yung (CRYPTO `92, J. Cryptology `98), which seems to us signif- icantly simpler and more intuitive than the original one. Moreover, the new proof achieves much better parameters (in terms of how security preserving the reduction is). Finally, our proof implies a more versatile interactive hashing theorem in a more general setting than that of Naor et al. Hardness ampli¯cations. We present a reduction for security ampli¯cation of regular one-way functions, which incur only £(n log(n)) blow-up in the input length. This improves upon the reduction of Goldreich, Impagliazzo, Levin, Venkatesan and Zuckerman (FOCS '90) in that the reduction does not need to know the regularity parameter of the functions (in terms of security, the two reductions are incomparable). ii Acknowledgements It is a great pleasure to thank the many people who helped me during my thesis. First and foremost, I wish to thank my advisor Omer Reingold. I am grateful to Omer for his patience and for sharing with me so much of his knowledge and wisdom. During the long conversations we had together, I learned a lot about science, but even more importantly, about how to enjoy science. With Omer's companionship, no task seemed too frightening. While never hesitating to provide sincere and determined opinions, Omer always did it in the most gentle way, teaching me a lot about the right way to deliver your point of view. Finally, I am grateful to Omer for his personal advice and friendship, I will always be in debt for it. My interest in Cryptography originated during my Masters studies with Oded Goldreich. Cryp- tography never seems more exciting than while being taught by Oded. Oded guided my ¯rst steps as a scientist, and helped me discover the beauty of research. Finally, numerous times through my PhD. studies I came to Oded seeking advice (both on scienti¯c and \non-scienti¯c" issues), and always bene¯ted from his smart and unconventional opinions. Oded Goldreich and Moni Naor served as my very helpful and joyful interim and ¯nal exami- nation committee, and I would like to thank them for that. Ronen Shaltiel was my ¯rst coauthor and was the ¯rst to see me as a colleague. Since then, Ronen enriched my education with many of his very intelligent and insightful observations. Throughout my studies, I have had the fortune of interacting with Yuval Ishai. His deep solid insights, everlasting patience and a®ection to Cryptography opened up a new world. During my last year at Weizmann Institute, I have had the fortune of interacting with Sha¯ Goldwasser. I am very grateful for her patience, and for the long hours she spent helping me to transform my thoughts into more digestible material. Other researchers that have deeply influenced my research include Cynthia Dwork, Yuval Emek, Danny Harnik, Jonathan Hoch, Thomas Holenstein, Yehuda Lindel, Jonathan Katz, Tal Moran, Moni Naor, Alon Rosen, Gil Segev and Salil Vadhan. I am very grateful for my discussions with them. In particular, I would like thank Danny Harnik for the collaboration that yielded the results presented in Chapters 5 and 6. I had be¯tted a lot from the Students Theory Seminar organized by Dana Moshkovitz and from the Crypto Reading Group organized by Sha¯ Goldwasser, and would like to thank them for their e®orts. I had many happy times during these years at Weizmann Institute. Dan Levi, Shai Litvak and Lior Noy took part in many of them. The \non-scienti¯c" activities in Weizmann Institute had also contributed a lot to my well being, this list includes the chess club, the swimming group, the iii Acknowledgements Acknowledgements Ultimate Frisbee group, and most importantly the Playback Theater group. I in great debt to the people who made these activities possible. Finally, I would like to thank my wife Liat, for her love and support through these long years. This thesis would never have happened without her. iv Contents 1 Introduction 1 1.1 Overview .......................................... 1 1.2 Statistically Hiding Commitment ............................. 2 1.2.1 Our Results ..................................... 3 1.3 Interactive Hashing ..................................... 3 1.3.1 Our Results ..................................... 3 1.4 Pseudorandom Generators ................................. 4 1.4.1 Our Results ..................................... 5 1.5 Hardness Ampli¯cation .................................. 5 1.5.1 Our Results ..................................... 6 1.6 Outline ........................................... 7 2 Preliminaries 8 2.1 General Notations ..................................... 8 2.1.1 Interactive Protocols ................................ 8 2.1.2 Distributions and Entropy ............................. 9 2.2 Pairwise Independent Hash Functions .......................... 9 2.2.1 Almost Pairwise Independent Hash Functions .................. 10 2.3 Randomness Extractors .................................. 11 2.3.1 One-way Functions ................................. 11 2.3.2 The Security of Cryptographic Constructions .................. 13 3 Statistically Hiding Commitments From Any One-Way Function 15 3.1 Introduction ......................................... 15 3.1.1 Our Results ..................................... 16 3.1.2 Our Techniques ................................... 16 3.1.3 Outline ....................................... 18 3.2 Preliminaries ........................................ 18 3.2.1 Universal One-way Hash Family ......................... 18 3.2.2 Commitment Schemes ............................... 20 3.2.3 Two-phase Commitment Schemes ......................... 22 3.3 The Construction ...................................... 24 3.3.1 Analyzing the Transformation ........................... 25 3.4 Putting it Together ..................................... 33 3.5 Conclusions ......................................... 35 v CONTENTS CONTENTS 4 A New Interactive Hashing Theorem 36 4.1 Introduction ......................................... 36 4.1.1 Interactive Hashing in the Setting of One-Way
Load more

Recommended publications
  • On the Foundations of Cryptography∗
    On the Foundations of Cryptography∗ Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [email protected] May 6, 2019 Abstract We survey the main paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems. We start by presenting some of the central tools used in cryptography; that is, computational difficulty (in the form of one-way functions), pseudorandomness, and zero-knowledge proofs. Based on these tools, we turn to the treatment of basic cryptographic applications such as encryption and signature schemes as well as the design of general secure cryptographic protocols. Our presentation assumes basic knowledge of algorithms, probability theory and complexity theory, but nothing beyond this. Keywords: Cryptography, Theory of Computation. ∗This revision of the primer [59] will appear as Chapter 17 in an ACM book celebrating the work of Goldwasser and Micali. 1 Contents 1 Introduction and Preliminaries 1 1.1 Introduction.................................... ............... 1 1.2 Preliminaries ................................... ............... 4 I Basic Tools 6 2 Computational Difficulty and One-Way Functions 6 2.1 One-WayFunctions................................ ............... 6 2.2 Hard-CorePredicates . .. .. .. .. .. .. .. ................ 9 3 Pseudorandomness 11 3.1 Computational Indistinguishability . ....................... 11 3.2 PseudorandomGenerators. ................. 12 3.3 PseudorandomFunctions . ...............
    [Show full text]
  • Draft Lecture Notes
    CS-282A / MATH-209A Foundations of Cryptography Draft Lecture Notes Winter 2010 Rafail Ostrovsky UCLA Copyright © Rafail Ostrovsky 2003-2010 Acknowledgements: These lecture notes were produced while I was teaching this graduate course at UCLA. After each lecture, I asked students to read old notes and update them according to the lecture. I am grateful to all of the students who participated in this massive endeavor throughout the years, for asking questions, taking notes and improving these lecture notes each time. Table of contents PART 1: Overview, Complexity classes, Weak and Strong One-way functions, Number Theory Background. PART 2: Hard-Core Bits. PART 3: Private Key Encryption, Perfectly Secure Encryption and its limitations, Semantic Security, Pseudo-Random Generators. PART 4: Implications of Pseudo-Random Generators, Pseudo-random Functions and its applications. PART 5: Digital Signatures. PART 6: Trapdoor Permutations, Public-Key Encryption and its definitions, Goldwasser-Micali, El-Gamal and Cramer-Shoup cryptosystems. PART 7: Interactive Proofs and Zero-Knowledge. PART 8: Bit Commitment Protocols in different settings. PART 9: Non-Interactive Zero Knowledge (NIZK) PART 10: CCA1 and CCA2 Public Key Encryption from general Assumptions: Naor-Yung, DDN. PART 11: Non-Malleable Commitments, Non-Malleable NIZK. PART 12: Multi-Server PIR PART 13: Single-Server PIR, OT, 1-2-OT, MPC, Program Obfuscation. PART 14: More on MPC including GMW and BGW protocols in the honest-but-curious setting. PART 15: Yao’s garbled circuits, Efficient ZK Arguments, Non-Black-Box Zero Knowledge. PART 16: Remote Secure Data Storage (in a Cloud), Oblivious RAMs. CS 282A/MATH 209A: Foundations of Cryptography °c 2006-2010 Prof.
    [Show full text]
  • How to Encipher Messages on a Small Domain Deterministic Encryption and the Thorp Shuffle
    How to Encipher Messages on a Small Domain Deterministic Encryption and the Thorp Shuffle Ben Morris1, Phillip Rogaway2, and Till Stegers2 1 Dept. of Mathematics, University of California, Davis, California 95616, USA 2 Dept. of Computer Science, University of California, Davis, California 95616, USA Abstract. We analyze the security of the Thorp shuffle, or, equivalently, a maximally unbalanced Feistel network. Roughly said, the Thorp shuffle on N cards mixes any N 1−1/r of them in O(r lg N) steps. Correspond- ingly, making O(r) passes of maximally unbalanced Feistel over an n-bit string ensures CCA-security to 2n(1−1/r) queries. Our results, which em- ploy Markov-chain techniques, enable the construction of a practical and provably-secure blockcipher-based scheme for deterministically encipher- ing credit card numbers and the like using a conventional blockcipher. 1 Introduction Small-space encryption. Suppose you want to encrypt a 9-decimal-digit plaintext, say a U.S. social-security number, into a ciphertext that is again a 9-decimal-digit number. A shared key K is used to control the encryption. Syn- tactically, you seek a cipher E: K×M → M where M = {0, 1,...,N− 1}, 9 N =10 ,andEK = E(K, ·) is a permutation for each key K ∈K. You aim to construct your scheme from a well-known primitive, say AES, and to prove your scheme is as secure as the primitive from which you start. The problem is harder than it sounds. You can’t just encode each plaintext M ∈Mas a 128-bit string and then apply AES, say, as that will return a 128-bit string and projecting back onto M will destroy permutivity.
    [Show full text]
  • Stdin (Ditroff)
    - 50 - Foundations of Cryptography Notes of lecture No. 5B (given on Apr. 2nd) Notes taken by Eyal Kushilevitz Summary In this (half) lecture we introduce and define the concept of secure encryption. (It is assumed that the reader is familiar with the notions of private-key and public-key encryption, but we will define these notions too for the sake of self-containment). 1. Secure encryption - motivation. Secure encryption is one of the fundamental problems in the field of cryptography. One of the important results of this field in the last years, is the success to give formal definitions to intuitive concepts (such as secure encryption), and the ability to suggest efficient implementations to such systems. This ability looks more impressive when we take into account the strong requirements of these definitions. Loosely speaking, an encryption system is called "secure", if seeing the encrypted message does not give any partial information about the message, that is not known beforehand. We describe here the properties that we would like the definition of encryption system to capture: g Computational hardness - As usual, the definition should deal with efficient procedures. That is, by saying that the encryption does not give any partial information about the message, we mean that no efficient algorithm is able to gain such an information Clearly, we also require that the encryption and decryption procedures will be efficient. g Security with respect to any probability distribution of messages - The encryption system should be secure independently of the probability distribution of the messages we encrypt. For example: we do not want a system which is secure with respect to messages taken from a uniform distribution, but not secure with respect to messages written in English.
    [Show full text]
  • On One-Way Functions and Kolmogorov Complexity
    On One-way Functions and Kolmogorov Complexity Yanyi Liu Rafael Pass∗ Cornell University Cornell Tech [email protected] [email protected] September 25, 2020 Abstract We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial t(n) ≥ (1 + ")n; " > 0, the following are equivalent: • One-way functions exists (which in turn is equivalent to the existence of secure private-key encryption schemes, digital signatures, pseudorandom generators, pseudorandom functions, commitment schemes, and more); • t-time bounded Kolmogorov Complexity, Kt, is mildly hard-on-average (i.e., there exists a t 1 polynomial p(n) > 0 such that no PPT algorithm can compute K , for more than a 1 − p(n) fraction of n-bit strings). In doing so, we present the first natural, and well-studied, computational problem characterizing the feasibility of the central private-key primitives and protocols in Cryptography. arXiv:2009.11514v1 [cs.CC] 24 Sep 2020 ∗Supported in part by NSF Award SATC-1704788, NSF Award RI-1703846, AFOSR Award FA9550-18-1-0267, and a JP Morgan Faculty Award. This research is based upon work supported in part by the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via 2019-19-020700006. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of ODNI, IARPA, or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for governmental purposes notwithstanding any copyright annotation therein.
    [Show full text]
  • On One-Way Functions and Kolmogorov Complexity
    On One-way Functions and Kolmogorov Complexity Yanyi Liu Rafael Pass∗ Cornell University Cornell Tech [email protected] [email protected] September 24, 2020 Abstract We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial t(n) ≥ (1 + ")n; " > 0, the following are equivalent: • One-way functions exists (which in turn is equivalent to the existence of secure private-key encryption schemes, digital signatures, pseudorandom generators, pseudorandom functions, commitment schemes, and more); • t-time bounded Kolmogorov Complexity, Kt, is mildly hard-on-average (i.e., there exists a t 1 polynomial p(n) > 0 such that no PPT algorithm can compute K , for more than a 1 − p(n) fraction of n-bit strings). In doing so, we present the first natural, and well-studied, computational problem characterizing the feasibility of the central private-key primitives and protocols in Cryptography. ∗Supported in part by NSF Award SATC-1704788, NSF Award RI-1703846, AFOSR Award FA9550-18-1-0267, and a JP Morgan Faculty Award. This research is based upon work supported in part by the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via 2019-19-020700006. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of ODNI, IARPA, or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for governmental purposes notwithstanding any copyright annotation therein. 1 Introduction We prove the equivalence of two fundamental problems in the theory of computing: (a) the exis- tence of one-way functions, and (b) mild average-case hardness of the time-bounded Kolmogorov Complexity problem.
    [Show full text]
  • Provably Secure Steganography
    IEEE TRANSACTIONS ON COMPUTERS, VOL. 58, NO. X, XXX 2009 1 Provably Secure Steganography Nicholas Hopper, Luis von Ahn, and John Langford Abstract—Steganography is the problem of hiding secret messages in “innocent-looking” public communication so that the presence of the secret messages cannot be detected. This paper introduces a cryptographic formalization of steganographic security in terms of computational indistinguishability from a channel, an indexed family of probability distributions on cover messages. We use cryptographic and complexity-theoretic proof techniques to show that the existence of one-way functions and the ability to sample from the channel are necessary conditions for secure steganography. We then construct a steganographic protocol, based on rejection sampling from the channel, that is provably secure and has nearly optimal bandwidth under these conditions. This is the first known example of a general provably secure steganographic protocol. We also give the first formalization of “robust” steganography, where an adversary attempts to remove any hidden messages without unduly disrupting the cover channel. We give a necessary condition on the amount of disruption the adversary is allowed in terms of a worst case measure of mutual information. We give a construction that is provably secure and computationally efficient and has nearly optimal bandwidth, assuming repeatable access to the channel distribution. Index Terms—Steganography, covert channels, provable security. Ç 1INTRODUCTION classic problem of computer security is the mitigation Steganographic “protocols” have a long and intriguing Aof covert channels. First introduced by Lampson [1], a history that predates covert channels, stretching back to covert channel in a (single-host or distributed) computer antiquity.
    [Show full text]
  • Deterministic Encryption with the Thorp Shuffle
    J Cryptol (2018) 31:521–536 https://doi.org/10.1007/s00145-017-9262-z Deterministic Encryption with the Thorp Shuffle Ben Morris Department of Mathematics, University of California, Davis, CA 95616, USA Phillip Rogaway and Till Stegers∗ Department of Computer Science, University of California, Davis, CA 95616, USA [email protected] Communicated by Kenneth Paterson. Received 3 April 2011 / Revised 26 July 2017 Online publication 25 August 2017 Abstract. We analyze the security of the Thorp shuffle, or, equivalently, a maximally unbalanced Feistel network. Roughly said, the Thorp shuffle on N cards mixes any − / N 1 1 r of them in O(r lg N) steps. Correspondingly, making O(r) passes of maximally ( − / ) unbalanced Feistel over an n-bit string ensures CCA security to 2n 1 1 r queries. Our results, which employ Markov chain techniques, particularly couplings, help to justify a practical, although still relatively inefficient, blockcipher-based scheme for deterministically enciphering credit card numbers and the like. Keywords. Card shuffling, Coupling, Format-preserving encryption, Modes of oper- ation, Symmetric encryption, Thorp shuffle, Unbalanced Feistel network. 1. Introduction 1.1. Small-Space Encryption Suppose you want to encrypt a 9-decimal-digit plaintext, say a US social security number, into a ciphertext that is again a 9-decimal-digit number. A shared key K is used to control the encryption. Syntactically, you seek a cipher E: K × M → M where M = 9 {0, 1,...,N −1}, N = 10 , and EK = E(K, ·) is a permutation for each key K ∈ K. You aim to construct your scheme from a well-known primitive, say AES, and to prove your scheme is as secure as the primitive from which you start.
    [Show full text]
  • Thesis Proposal: Toward a Theory of Steganography
    Thesis Proposal: Toward a Theory of Steganography Nicholas Hopper School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Abstract Informally, steganography refers to the practice of hiding secret messages in communications over a public channel so that an eavesdropper (who listens to all communications) cannot even tell that a secret message is being sent. In contrast to the active literature proposing new ad hoc steganographic protocols and analyzing flaws in existing protocols, there has been very little work on formalizing steganographic notions of security, and none giving complete, rigorous proofs of security in any non-trivial model. My thesis will initiate the study of steganography from a complexity-theoretic point of view. Mod- elling the communication between two parties as a probabilistic channel, I will introduce several different steganographic security properties, and for each of these properties, attempt to determine the necessary and sufficient conditions under which secure steganography is possible. Furthermore, I propose to investigate the open question \How much information can be safely encoded by a stegosystem?"[3] by proving an upper bound MAX on the bit rate of any secure, uni- versal stegosystem; and giving a protocol which achieves rate Ω(MAX), thus providing a universal stegosystem of approximately optimal rate. 1 Introduction The scientific study of steganography in the open literature began in 1983 when Simmons [11] stated the problem in terms of communication in a prison. In his formulation, two inmates, Alice and Bob, are trying to hatch an escape plan. The only way they can communicate with each other is through a public channel, which is carefully monitored by the warden of the prison, Ward.
    [Show full text]
  • Multi Collision Resistant Hash Functions and Their Applications∗
    Electronic Colloquium on Computational Complexity, Report No. 97 (2017) Multi Collision Resistant Hash Functions and their Applications∗ Itay Berman Akshay Degwekar Ron D. Rothblum Prashant Nalini Vasudevan May 30, 2017 Abstract Collision resistant hash functions are functions that shrink their input, but for which it is computationally infeasible to find a collision, namely two strings that hash to the same value (although collisions are abundant). In this work we study multi-collision resistant hash functions (MCRH) a natural relaxation of collision resistant hash functions in which it is difficult to find a t-way collision (i.e., t strings that hash to the same value) although finding (t − 1)-way collisions could be easy. We show the following: • The existence of MCRH follows from the average case hardness of a variant of Entropy Approximation, a problem known to be complete for the class NISZK. • MCRH imply the existence of constant-round statistically hiding (and computationally binding) commitment schemes. In addition, we show a blackbox separation of MCRH from any one-way permutation. ∗MIT. Emails: {itayberm, akshayd, ronr, prashvas}@mit.edu. Research supported in part by NSF Grants CNS-1413920 and CNS-1350619, and by the Defense Advanced Research Projects Agency (DARPA) and the U.S. Army Research Office under contracts W911NF-15-C-0226 and W911NF-15-C-0236. ISSN 1433-8092 Contents 1 Introduction 1 1.1 Our Results.........................................2 1.2 Related Works.......................................3 1.3 Our Techniques.......................................4 2 Preliminaries 10 2.1 Many-wise Independent Hashing............................. 11 2.2 Load Balancing....................................... 11 3 Constructing MCRH Families 12 3.1 Entropy Approximation.................................
    [Show full text]
  • Simultaneous Secrecy and Reliability Amplification for a General Channel
    Simultaneous Secrecy and Reliability Amplification for a General Channel Model Russell Impagliazzo1, Ragesh Jaiswal2, Valentine Kabanets3, Bruce M. Kapron4, Valerie King4, and Stefano Tessaro5 1 University of California, San Diego [email protected] 2 Indian Institute of Technology Delhi [email protected] 3 Simon Fraser University [email protected] 4 University of Victoria [email protected], [email protected] 5 University of California, Santa Barbara [email protected] Abstract. We present a general notion of channel for cryptographic purposes, which can model either a (classical) physical channel or the consequences of a cryptographic protocol, or any hybrid. We consider simultaneous secrecy and reliability amplification for such channels. We show that simultaneous secrecy and reliability amplification is not pos- sible for the most general model of channel, but, at least for some values of the parameters, it is possible for a restricted class of channels that still includes both standard information-theoretic channels and keyless cryptographic protocols. Even in the restricted model, we require that for the original channel, the failure chance for the attacker must be a factor c more than that for the intended receiver. We show that for any c > 4, there is a one-way protocol (where the sender sends information to the receiver only) which achieves simultaneous secrecy and reliability. From results of Holenstein and Renner (CRYPTO'05 ), there are no such one-way protocols for c < 2. On the other hand, we also show that for c > 1:5, there are two-way protocols that achieve simultaneous secrecy and reliability.
    [Show full text]
  • Deterministic Encryption: Definitional Equivalences and Constructions Without Random Oracles
    A preliminary version of this paper appears in Advances in Cryptology – CRYPTO ‘08, Lecture Notes in Computer Science vol. xx, D. Wagner ed., Springer-Verlag, 2008. This is the full version. Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles MIHIR BELLARE∗ MARC FISCHLINy ADAM O’NEILLz THOMAS RISTENPARTx February 17, 2009 Abstract We strengthen the foundations of deterministic public-key encryption via definitional equivalences and standard-model constructs based on general assumptions. Specifically we consider seven notions of privacy for deterministic encryption, including six forms of semantic security and an indistinguishability notion, and show them all equivalent. We then present a deterministic scheme for the secure encryption of uniformly and independently distributed messages based solely on the existence of trapdoor one-way permutations. We show a generalization of the construction that allows secure deterministic encryption of independent high-entropy messages. Finally we show relations between deterministic and standard (randomized) encryption. ∗ Dept. of Computer Science & Engineering 0404, University of California San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0404, USA. Email: [email protected]. URL: http://www.cs.ucsd.edu/˜mihir. Supported in part by NSF grants CNS 0524765 and CNS 0627779 and a gift from Intel Corporation. y Dept. of Computer Science, Darmstadt University of Technology, Hochschulstrasse 10, 64289 Darmstadt, Germany. Email: [email protected]. URL: http://www.fischlin.de. Supported in part by the Emmy Noether Program Fi 940/2-1 of the German Research Foundation (DFG). z College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, GA 30332, USA. Email: [email protected].
    [Show full text]