PROTOCOLS FOR RELIABLE AND SECURE MESSAGE TRANSMISSION

3y ago
26 Views
2 Downloads
2.22 MB
286 Pages
Last View : 1m ago
Last Download : 3m ago
Upload by : Cade Thielen
Transcription

PROTOCOLS FOR RELIABLE AND SECUREMESSAGE TRANSMISSIONA THESISsubmitted byASHISH CHOUDHURYfor the award of the degreeofDOCTOR OF PHILOSOPHYDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERINGINDIAN INSTITUTE OF TECHNOLOGY, MADRASMAY 2010

Thesis CertificateThis is to certify that the thesis entitled Protocols for Reliable and SecureMessage Transmission submitted by Ashish Choudhury to the Indian Instituteof Technology Madras, Chennai for the award of the Degree of Doctor of Philosophyis a record of bona-fide research work carried out by him under my supervision andguidance. The contents of this thesis have not been submitted to any other universityor institute for the award of any degree or diploma.Chennai 600036Research GuideDate:(Prof. C. Pandu Rangan)i

Dedicated ToTo the All Mighty Supreme Personality of Godhead Sri Krsna andto My Parents, Who Brought Me to This Worldii

AcknowledgementsFirst of all, I would like to thank my advisor Prof. C.Pandu Rangan who has beenhaving a tremendous influence on my professional development. He introduced me tothe world of Algorithms, which motivated me to do research in Theoretical ComputerScience, specially in the field of cryptography. I still remember the day when I wentto him with a urge to join PhD under him and asked ”Sir, will you guide me if I joinPhD under you?” and he replied ”you are most welcome”. That day really changed mycareer. I never thought that in him, I am going to get a great advisor, a great teacher,a great critic, a great friend and overall a great philosopher. For the past four years,we have developed a special bond, which is much much more than a student-advisorrelationship. I have always considered him my father figure and truly speaking, he alsonever let me down and always treated me like his own pet child. He always providedme with the best facilities, whether it is a research environment (I can never forget thesmall, separate TCS Lab II, which he allocated to me for doing peaceful research) orwhether it is financial help (I can never forget the personal money which he gave meas advance to visit U.S and Canada for attending CRYPTO 2009 and PODC 2009)or whether it is personal advise (he always gave me personal suggestions whenever Irequired it). I am always going to miss his after leaving IITM. Nevertheless, I willalways be indebted to him for whatever he has done for me till now.Beside my advisor, I also would like to acknowledge the members of my doctoralcommittee namely, Prof. P. Sreenivasa Kumar, Prof. S. V. Raghavan, Prof. KamalaKrithivasan, Prof. S. A. Choudam and Dr. A. Thangaraj for their encouragement andinvaluable suggestions during my doctoral committee meetings. I would specially liketo thank Prof. Kamala Krithivasan, who was my advisor during my M. S (by research)at IITM. She always took special interest in my progress and always motivated andencouraged me to do well. I would also like to thank the present and previous head ofthe department, Prof. C. Siva Ram Murthy and Prof. T. A. Golsalves, respectively fortheir kind help.I would like to thank Dr. Tal Rabin, IBM research for her collaboration and lotof insightful remarks on some of our articles. Her critical remarks helped me a lotto improve my writing style and presentations. I can never forget the brain stormingsession and interaction that we used to have over Internet.My special thanks to Dr. Kannan Srinathan of IIT Hyderabad, who was my seniorat TCS lab. Truly speaking, he is the one who motivated me to do research in securedistributed computing. I have never seen a person like him. His simplicity and innocence is one thing, which I always tried to follow but without any success. For me, heis the best researcher that TCS lab has produced.I would like to thank Prof. Bimal Roy and Prof. Palash Sarkar of ISI Kolkatafor fruitful discussions (both technical as well as personal) that we had during everytime we meet for various conferences. Specially I would like to thank Prof. Bimal Roy(Bimal da) who helped me significantly during by visit to Imphal for National levelinstructional workshop.My sincere thanks to all of our department office staffs Radhai Madam, SaradhaMadam, Balu Sir, Prema madam and Murali for helping me whenever I required. Iwould also like to thank Saraswati madam and Raghu sir of administrative block forprocessing my administrative papers quickly, whenever I required it.My lab mates Esha, Chaya, Billy, Thiru, Sai, Shinku, Amjed, Nisha, Saki, Manila,Kishore, Sobin, Madhu, Preetha madam, KP, Siddharth, Meena, Harini, Balu, Ashiii

win, Raghavendra, Naresh, Sharmila and Vivek deserve special acknowledgements.Specially, I would like to thank Ashwin (BV) for few of the collaborative work that wedid together. Special mention goes to Billy, Thiru, Sai, Shinku, Nainesh and the pair(Vivek, Sharmi) for their nice company. Also, their cute son and future cryptographerof TCS lab, swithin deserves special acknowledgement.The gang of close friends, Rima, Tanmoy, Prasun, Pawan, Hima, Tarun, Ashish,Hitesh, Kanchan, Kishore, Priya have stood by me though the ups and downs of mylife. Specially, I would like to thank Kanchan, Priya and Bhanu didi, whom I alwaysloved like my own sisters. They always prayed for me during my undergrad and theirprayers helped me a lot to achieve what I am today. All my friends at GRKIST,specially Ashish, Shanil, Rochak, Purvik, Shataksh and many others deserve specialacknowledgement. The time that I spent with them during my undergrad is simplyunforgettable. My close friends Pawan and Prasun at IITM made my stay in IITM apleasurable and memorable experience. I will never forget about those endless gossips,laughs that we had at our mess table. Cheers to you guys! Your friendship is trulybeyond words of acknowledgement.My sincere acknowledgements to Infosys Technology India for their Ph.D. fellowshipand financial assistance during this work. I would also like to thank IARCS for thefinancial support provided to me during my visit to Japan for attending ICITS 2009.Now I would like to thank few remarkable people who had, are having and willcontinue to have a tremendous influence on my life. My parents, Dr. Ajit Choudhuryand Chanda Choudhury, for introducing me to the world and bestowing me with allthe love of the world. Though my parents do not know too much about research,they somehow always supported me to do research. Salim uncle, who though beingnot my own uncle, has always loved me like his own son, deserved a very very specialacknowledgement. My uncle, Ashit Choudhury from whom I got the first inspirationto do higher studies also holds a special place for me. My aunt Sikha and my cousinAnamika also deserves special acknowledgement. My dearest brother Avinash (Rahul)holds special place for me. Though we have several conflictions over various issues, healways respected me. He will always hold a special place in my life. I would alwaysrespect my maternal grand other and maternal grand father, who virtually gave me anew life. Otherwise, after getting the paralysis attack during my childhood, I wouldhave simply lied down in the bed for the rest of my life. The fact that I am normaltoday is ONLY and ONLY due to their effort. My grandfather, grandmother, maternaluncle and aunt also deserves special acknowledgement for their blessings for me.My father in law, mother in law and sister in law also deserves special acknowledgement. In them, I got another family. They always treated me like their own sonand brother respectively. My father in law, Mr. Ahibhusan Patra deserves specialacknowledgement. I have never seen a true karma yogi like him. He always inspiredme to do my best.Now I would like to say something about one of the most special person in my life.She is no other than my sweet wife Arpita Patra, who also happened to be my researchcolleague. In her, I have found a true friend, a true critic, a true pillar of support, atrue philosopher, a true well wisher and above all, a true loving wife. My every momentof research and personal life has been a cherishing experience in her company. Though,we fight and argue a lot everyday over various personal and research relate issues, atthe end of day, she is my loving wife. She is the best gift that IIT Madras has giftedto me.Finally, I would like to thank the Supreme personality of Godhead, Lord Krsna,who created the universe and gave the supreme knowledge of “niskama karmayoga”iv

(The art of performing prescribed duties without having any attachment to its fruitand without having any material expectations) to mankind (that I am trying my bestto implement in my life). I would sincerely like to thank the devotees of ISKCON,for their wonderful lectures on Bhagwad Gita. This helped me a lot to discover thespirituality within me and understand the true principles of life.v

AbstractConsider the following problem: a sender S and a receiver R are part of an unreliable,connected, distributed network. The distrust in the network is modelled by an entitycalled adversary, who has unbounded computing power and who can corrupt some ofthe nodes of the network (excluding S and R) in a variety of ways. S wishes to sendto R a message mS that consists of ℓ elements, where ℓ 1, selected uniformly from afinite field F. The challenge is to design a protocol, such that after interacting with S asper the protocol, R should output mS without any error (perfect reliability). Moreover,this hold irrespective of the disruptive actions done by the adversary. This problemis called reliable message transmission or RMT in short. The problem of secure message transmission or SMT in short requires an additional constraint that the adversaryshould not get any information about the message what so ever in information theoreticsense (perfect secrecy). Security against an adversary with infinite computing poweris also known as non-cryptographic or information theoretic or Shannon security andthis is the strongest notion of security. Notice that since the adversary has unboundedcomputing power, we cannot solve RMT and SMT problem by using classical cryptographic primitives such as public key cryptography, digital signatures, authenticationschemes, etc as the security of all these primitives holds good only against an adversaryhaving polynomially bounded computing power.RMT and SMT problem can be studied in various network models and adversarialsettings. We may use the following parameters to describe different settings/modelsfor studying RMT/SMT:1. Type of Underlying Network — Undirected Graph, Directed Graph, Hypergraph.2. Type of Communication — Synchronous, Asynchronous.3. Adversary capacity — Threshold Static, Threshold Mobile, Non-threshold Static,Non-threshold Mobile.4. Type of Faults — Fail-stop, Passive, Byzantine, Mixed.Irrespective of the settings in which RMT/SMT is studied, the following issues arecommon:1. Possibility: What are the necessary and sufficient structural conditions to besatisfied by the underlying network for the existence of any RMT/SMT protocol,tolerating a given type of adversary?2. Feasibility: Once the existence of a RMT/SMT protocol in a network is ascertained, the next natural question is, does there exist an efficient protocol on thegiven network?3. Optimality: Given a message of specific length, what is the minimum communication complexity (lower bound) needed by any RMT/SMT protocol to transmitthe message and how to design a polynomial time RMT/SMT protocol whosetotal communication complexity matches the lower bound on the communicationcomplexity (optimal protocol)?In this dissertation, we look into the above issues in several network models andadversarial settings. This thesis reports several new/improved/efficient/optimal solutions, gives affirmative/negative answers to several significant open problems and lastbut not the least, provides first solutions to several newly formulated problems.vi

Contents1 Introduction1.1 Overview of RMT and SMT . . . . . . . . . . . . . . . . . . . . . .1.2 Motivation for Studying RMT and SMT . . . . . . . . . . . . . . .1.3 RMT, SMT and Its Variants . . . . . . . . . . . . . . . . . . . . .1.4 Various Models for Studying RMT and SMT . . . . . . . . . . . .1.4.1 Underlying Network: Undirected, Directed and Hypergraph1.4.2 Type of Communication: Synchronous and Asynchronous .1.4.3 Adversary Capacity . . . . . . . . . . . . . . . . . . . . . .1.4.4 Type of Faults: Failstop, Passive, Byzantine and Mixed . .1.4.5 Type of Security: Perfect and Statistical . . . . . . . . . . .1.5 Taxonomy of Settings for Studying RMT and SMT . . . . . . . . .1.6 A Brief Overview of the Existing Results . . . . . . . . . . . . . . .1.7 Motivation of Our Work . . . . . . . . . . . . . . . . . . . . . . . .1.8 Our Contribution and Models Discussed in this Thesis . . . . . . .1.9 Organization of the Thesis and Brief Overview of Our Results . . .2 Definition and Preliminaries2.1 Definition of Various Type of Corruptions2.2 Definition of RMT, SMT and Its Variants2.3 Coding Theory Preliminaries . . . . . . .2.3.1 RS Decoding Algorithm . . . . . .I.123344445556688.1414141616Results for PRMT and SRMT in Synchronous Network3 PRMT in Undirected Networks Tolerating Static Byzantine Adversary3.1 Underlying Network Model and Adversary Settings . . . . . . . . . . . .3.2 Known Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3.2.1 Our Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . .3.3 Protocols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3.3.1 Single Phase PRMT Tolerating Astatictb3.3.2 Increasing the Throughput of Protocol 1-PRMT-Byzantine . . . .3.3.3 Reliably Communicating a Set of Conflicts . . . . . . . . . . . .3.3.4 Protocol 3-Optimal-PRMT-Static-Byzantine . . . . . . . . . . . . .3.4 Concluding Remarks and Open Problems . . . . . . . . . . . . . . . . .27282829303030313234364 PRMT in Undirected Networks Tolerating Mobile Byzantine Adversary384.1 Underlying Network Model and Adversary Settings . . . . . . . . . . . . 38vii

4.24.34.44.54.6Existing Literature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4.2.1 Our Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . .Limitations of Matching Technique . . . . . . . . . . . . . . . . . . . . .Protocols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4.4.1 Union Technique . . . . . . . . . . . . . . . . . . . . . . . . . . .4.4.2 Protocol 3-Optimal-PRMT-Mobile-Byzantine . . . . . . . . . . . .PRMT Tolerating Mobile Adversary (in Terms of Rounds) . . . . . . . .4.5.1 Round Based Network and Adversary Settings . . . . . . . . . .4.5.2 Transmission Graph . . . . . . . . . . . . . . . . . . . . . . . . .4.5.3 Computing Minimum Number of Rounds for PRMT with ρ 1 .4.5.4 Finding rmin in the Presence of More than 2tb 1 Paths for ρ 14.5.5 Computing rmin for Arbitrary Roaming Speed . . . . . . . . . .4.5.6 Computing Minimum Number of Rounds for Static Adversary .4.5.7 Communication Optimal PRMT Protocol in Terms of Rounds .Concluding Remarks and Open Problems . . . . . . . . . . . . . . . . .3939404040424445464850515455575 On Tradeoff Among Network Connectivity, Phase Complexity andCommunication Complexity of PRMT Tolerating Static Mixed Adversary595.1 Underlying Network Model and Adversary Settings . . . . . . . . . . . . 595.2 Existing Results for PRMT Tolerating Astatic60(tb ,tf ) . . . . . . . . . . . . . . .5.2.15.35.45.55.65.75.85.9Justification to Study PRMT Tolerating Astatic(tb ,tf ). . . . . . . . .Astatic(tb ,tf )Holy Grail Problem of PRMT Tolerating. . . . . . . . . . . . .Our Solution to the Holy Grail Problem . . . . . . . . . . . . . . . . . .An Overview of Our Results in This Chapter . . . . . . . . . . . . . . .Bounds for Single Phase PRMT Tolerating Astatic(tb ,tf ) . . . . . . . . . . . .5.6.1 Increasing the Throughput of Protocol 1-PRMT-Mixed . . . . . .5.6.2 PRMT Based on Both Error Correction and Detection CapabilityAnswer to the Holy Grail Problem of PRMT . . . . . . . . . . . . . . .Upper Bound on Phase Complexity of PRMT Tolerating Astatic(tb ,tf ) . . . .5.8.1 Protocol 3-PRMT-Static-Mixed: A Three Phase PRMT Protocol5.8.2 A Worst Case O(D) Phase PRMT Protocol Tolerating Astatic(tb ,tf ) .Concluding Remarks and Open Problems . . . . . . . . . . . . . . . . .6061626263656568737375796 PRMT in Undirected Networks Tolerating Mobile Mixed Adversary 816.1 Network Model and Adversary Settings . . . . . . . . . . . . . . . . . . 816.2 Characterization and Lower Bound on Communication Complexity . . . 826.2.1 PRMT Against Amobile(tb ,tf ) Requires More Communication Than PRMTAgainst Astatic(tb ,tf ) . . . . . . . . . . . . . . . . . . . . . . . . . . . .6.36.4Amobile(tb ,tf ). . . . . . . . . . . .Communication Optimal PRMT ToleratingConcluding Remarks and Open Problems . . . . . . . . . . . . . . . . .7 PRMT in Directed Networks Tolerating Static Byzantine Adversary7.1 Directed Network Model . . . . . . . . . . . . . . . . . . . . . . . . . . .7.2 Characterization of Communication Optimal PRMT in Directed Network7.2.1 Black Box Used in Our Protocol . . . . . . . . . . . . . . . . . .7.2.2 A Three Phase Communication Optimal PRMT Protocol . . . .7.3 Concluding Remarks and Open Problems . . . . . . . . . . . . . . . . .viii888891929293949698

8 SRMT in Undirected Networks Tolerating Static Mixed Adversary8.1 Network Model and Adversary Settings . . . . . . . . . . . . . . . . . .8.1.1 Tools Used in SRMT and SSMT Protocols . . . . . . . . . . . .8.2 Characterization of SRMT and Bounds on the Communication Complexity of SRMT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .8.2.1 Characterization of SRMT in Undirected Networks . . . . . . . .8.2.2 Lower Bound and Upper Bound for Single Phase SRMT . . . . .8.2.3 Lower Bound and Upper Bound for Multi Phase SRMT . . . . .8.3 Concluding Remarks and Open Problems . . . . . . . . . . . . . . . . .IIResults for PSMT and SSMT in Synchronous Network9 PSMT in Undirected Networks Against Static Byzantine. . . . . . . .9.1 Existing Results for PSMT Tolerating Astatictb. . . . . . .9.1.1 Single Phase PSMT Tolerating Astatictbstatic. . . . . . . .9.1.2 Multi Phase PSMT Tolerating Atb9.2 A Three Phase Polynomial Time PSMT Protocol . . . . . .9.2.1 Extracting Randomness . . . . . . . . . . . . . . . .9.2.2 Protocol 3-Optimal-PSMT-Static-Byzantine . . . . . .9.3 Two Phase Communication Optimal PSMT Protocol . . . .9.4 Open Problem . . . . . . . . . . . . . . . . . . . . . . . . .999999100100101105105107Adversary108. . . . . . . 108. . . . . . . 108. . . . . . . 109. . . . . . . 111. . . . . . . 112. . . . . . . 112. . . . . . . 114. . . . . . . 11510 PSMT in Undirected Networks Against Mobile Byzantine Adversary11610.1 Network Model and Adversary Settings . . . . . . . . . . . . . . . . . . 116. . . . . . . . . . . . . . . 11710.2 Existing Results for PSMT Tolerating Amobiletb. . . 11710.3 A Three Phase Communication Optimal PSMT Tolerating Amobiletb10.4 Concluding Remarks and Open Problems . . . . . . . . . . . . . . . . . 12011 PSMT in Undirected Networks Tolerating Static Mixed Adversary 12111.1 Network Model and Adversary Settings . . . . . . . . . . . . . . . . . . 12111.2 Existing Results for PSMT Tolerating Astatic(tb ,tf ,tp ) . . . . . . . . . . . . . . 12211.2.1 Characterization and Lower Bound for Single Phase PSMT . . . 12211.2.2 Characterization and Lower Bound for Multi Phase PSMT . . . 12311.3 Limitations of Protocol 3-Optimal-PSMT-Static-Byzantine Against Astatic(tb ,tf ,tp ) 12411.4 A Four Phase Communication Optimal PSMT Tolerating Astatic(tb ,tf ,tp ) . . . 12511.4.1 A Conditional Single Phase Protocol to Establish a One Time Pad12511.4.2 A Three Phase Protocol to Identify at least t2b Byzantine Corrupted Wires . . . . .

INDIAN INSTITUTE OF TECHNOLOGY, MADRAS MAY 2010. . I never thought that in him, I am going to get a great advisor, a great teacher, a great critic, a great friend and overall a great philosopher. For the past four years, . Krithivasan, Prof. S. A. Choudam and Dr. A. Thangaraj for their encouragement and

Related Documents:

Bruksanvisning för bilstereo . Bruksanvisning for bilstereo . Instrukcja obsługi samochodowego odtwarzacza stereo . Operating Instructions for Car Stereo . 610-104 . SV . Bruksanvisning i original

10 tips och tricks för att lyckas med ert sap-projekt 20 SAPSANYTT 2/2015 De flesta projektledare känner säkert till Cobb’s paradox. Martin Cobb verkade som CIO för sekretariatet för Treasury Board of Canada 1995 då han ställde frågan

service i Norge och Finland drivs inom ramen för ett enskilt företag (NRK. 1 och Yleisradio), fin ns det i Sverige tre: Ett för tv (Sveriges Television , SVT ), ett för radio (Sveriges Radio , SR ) och ett för utbildnings program (Sveriges Utbildningsradio, UR, vilket till följd av sin begränsade storlek inte återfinns bland de 25 största

Hotell För hotell anges de tre klasserna A/B, C och D. Det betyder att den "normala" standarden C är acceptabel men att motiven för en högre standard är starka. Ljudklass C motsvarar de tidigare normkraven för hotell, ljudklass A/B motsvarar kraven för moderna hotell med hög standard och ljudklass D kan användas vid

LÄS NOGGRANT FÖLJANDE VILLKOR FÖR APPLE DEVELOPER PROGRAM LICENCE . Apple Developer Program License Agreement Syfte Du vill använda Apple-mjukvara (enligt definitionen nedan) för att utveckla en eller flera Applikationer (enligt definitionen nedan) för Apple-märkta produkter. . Applikationer som utvecklas för iOS-produkter, Apple .

SECURE NETWORK PROTOCOLS 4 Introduction This ebook explores how secure network protocols work. It will explain key concepts such as encryption, cryptographic hashes and public key encryption. The two most popular secure network protocols, SSL/TLS and SSH, will be examined, and their secure file transfer counterparts, FTPS and

St. Anthony Hospital Protocols Operational Protocols 1 Revised 02/14/2018 SYSTEM PROTOCOLS The "Denver Metro Prehospital Protocols" have been implemented for all levels of EMTs, AEMTs, EMT-Is and Paramedics. Any reference in these protocols to the medical acts

This presentation and SAP's strategy and possible future developments are subject to change and may be changed by SAP at any time for any reason without notice. This document is 7 provided without a warranty of any kind, either express or implied, including but not limited to, the implied warranties of merchantability, fitness for a .