DOCSLIB.ORG

Quadratic Residues and Applications in Cryptography

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quadratic Residues and Applications in Cryptography Alexandru Ioan Cuza University of Ia¸si,Rom^ania Department of Computer Science Quadratic Residues and Applications in Cryptography by Anca-Maria Nica supervisor Prof. Dr. C˘at˘alinDima 2020 . Doctoral committee: Conf.Dr. Adrian Iftene - committee chairman Alexandru Ioan Cuza University of Ia¸si Prof.Dr. C˘at˘alinDima - doctoral supervisor Alexandru Ioan Cuza University of Ia¸si/ \Paris Est Creteil - Val de Marne" Prof.Dr. Constantin Popescu - reviewer University of Oradea Prof.Dr. Ferucio Laurent¸iu T¸iplea - reviewer Alexandru Ioan Cuza University of Ia¸si Conf.Dr. Octavian Catrina - reviewer University Politehnica of Bucharest Conf.Dr. Mihai Dumitru Prunescu - reviewer University of Bucharest Acknowledgements I became more and more concerned about the meaning of life, whose essence can be summarized in one word: giving. But you cannot give what you do not have, so growing is another leading word in my life. I would like to have a positive impact on others' lives, and I am doing this profoundly inspired by the influence I got, in turn, from the most important people in my life. I'm looking around me and I can not feel anything else than gratefulness. I am grateful for the models I have, because life teaches me a lot by their examples. I am surrounded by special people, beginning with my mentor, Fr. Teodosie, who is a true father to me. He is sustaining me in all situations, he is a live model of being a Christian for me, an example of empathizing and communicating with people. I learned from him that you have to be very patient with people, as he is with me all the time. He taught me, by his life, that the strongest way of teaching others is by your own example. He taught me that before night you are the leader who establishes the timetable for the next day. Then, in the morning, you have to be a committed employee and not to negotiate the things you have already planned to do. He also showed me how one can make a masterpiece from each day and praise God for all. I would like to thank my supervisors Prof. Dr. Ferucio Laurent¸iu T¸iplea and Prof. Dr. C˘at˘alinDima for all their help and support. Professor T¸iplea taught me that you can always be kind with others, no matter how they act or speak to you. I realized through his example that you always have to see value in people, you have to focus on their strengths, you have to appreciate, respect, and believe in them and also that you have to add value to people all the time - as John Maxwell said - these are the seeds for success. He gently guided me all these six years, and still does in a very efficient and thoughtful way. From Lect. Dr. Sorin Iftene I have learned that whenever you have the opportunity to encourage people, it is a great idea to do so. He also taught me by his example how to always be thoughtful and attentive to others' needs. From FCS I have learned how to act with yourself and the fact that you can be as strict as you wish with yourself but very lenient with others. I am also grateful to FCS for its constant support and mentoring and for offering the perfect environment for writing this thesis. iii They are like a lighthouse showing the direction. I look forward to giveback, to reward the trust that they invested in me and without which I would not have gotten here. Even if words are too poor, I would like to thank them all, along with other great people that surrounded me throughout the process, for their contribution. I express here my profound gratitude to God, to the Holy Theotokos, to all Saints and to my guardian angel who took care of me all the time. This thesis does not represent the ending but rather the beginning of a new period of research in this area. In the last five years of study I had the chance to attend many (inter)national conferences and winter/summer schools on related topics that opened up new horizons in my research and also spurred me to improve my English enough to be able to teach in English. I am ever so grateful to our faculty and to all those who have facilitated such opportunities. One of them is Lect. Dr. Emanuel Onica who helped me to attend a lot of interesting and useful scientific events by his projects. Last but not least, I want to thank my parents and my friends who understood me patiently and sustained me along the way. Words are never enough to express my gratitude. Thank you! God bless you all! iv . To Fr. Teodosie, v vi Contents Preface 5 Thesis overview . .5 Thesis contributions . .8 List of publications 11 1 Introduction to cryptography and quadratic residues 13 1.1 Some history . 13 1.2 Principles, goals and security in modern cryptography . 16 1.3 Quadratic residues in mathematics . 22 1.4 Quadratic residues in cryptology . 25 1.5 Literature review . 26 2 Prerequisites 31 2.1 Congruence . 31 2.2 Probabilities . 32 2.3 Complexity . 35 2.4 Quadratic residues . 35 2.4.1 Legendre and Jacobi symbols . 37 2.4.2 Computing square roots . 40 3 On the distribution of quadratic residues 45 3.1 Counting quadratic residues and non-residues in the set a + X .... 49 3.1.1 The case of prime moduli . 50 3.1.2 The case of RSA moduli . 56 3.2 Computing probabilities on sets Y(a + X)............... 68 vii 3.3 Concluding remarks . 70 4 Applications of QR to IBE 71 4.1 Cocks' IBE scheme . 72 4.1.1 Cocks' IBE ciphertexts . 73 4.1.2 Galbraith's test . 78 4.1.3 Anonymous Cocks' schemes . 81 4.1.4 Concluding remarks . 87 4.2 Boneh-Gentry-Hamburg's IBE scheme . 87 4.2.1 Associated polynomials . 89 4.2.2 The BGH scheme and its security . 89 4.2.3 A new security analysis for BasicIBE scheme . 95 4.2.4 Concluding remarks . 97 4.3 QR-based IBE schemes that fail security . 98 4.3.1 Jhanwar-Barua scheme . 98 4.3.2 Other insecure IBE schemes based on QR . 103 4.3.3 Concluding remarks . 104 4.4 Continuous mutual authentication . 105 4.4.1 Real privacy management . 106 4.4.2 RPM description . 111 4.4.3 Continuous mutual authentication and data security . 116 4.4.4 Concluding remarks . 118 4.5 Pseudo-random generators . 119 4.5.1 Pseudo-randomness from QR . 120 4.5.2 Concluding remarks . 122 5 From identity-based to attribute-based encryption 123 5.1 Introduction . 123 5.2 ABE and the backtracking attack . 126 5.3 KP-ABE for Boolean circuits using secret sharing and bilinear maps . 131 5.3.1 The secure KP-ABE Scheme 1.................. 131 5.3.2 Concluding remarks . 142 5.4 KP-ABE for Boolean circuits using secret sharing and multilinear maps 143 viii 5.4.1 The secure KP-ABE Scheme 2.................. 144 5.4.2 Concluding remarks . 155 6 Conclusion and open problems 157 Bibliography 163 ix x Preface About this thesis The most inspiring aspect in doing this thesis was \the improvement", not only re- garding some schemes and boundaries in security proofs, but reaching the next level in the research process, growth and comprehending. This is what guarantees the future results and gives beauty to the process. We started five years ago from some problems which are of great interest in cryp- tography. Searching an efficient variant of Cocks' IBE scheme was one of them. Then, starting from it, we investigated the set of integers which are obtained by adding a ∗ quadratic residue to an integer in Zn, i.e. the set a + QRn, as we will deeply discuss in Chapter 3 of this thesis. Another starting point in this research was the proof of Galbraith's test, addressed in detail in Section 4.1.2, the anonymization and the se- curity of Cocks' IBE scheme, together with applications of this scheme and attribute based encryption, which is considerable useful in cloud computing, access control in cloud and other fields. These are the main subjects which we describe in this thesis. Thesis overview Chapter 1: Introduction to cryptography and quadratic residues In the first chapter, after a short review of the thesis, we present some phases in the history of cryptology - one of the areas regarding information hiding (see Figure 1.1 on page 16). We emphasize the niche of Public Key Cryptography (PKE) and specially Identity-based Encryption (IBE), until we get to IBE based on quadratic residues (QR). This is one of the areas where we applied some of our mathematical results in 5 6 Preface Chapter 3. In Section 1.2 we state two main principles of cryptology followed immediately by the objectives of cryptography together with the security goals that have to be satisfied according to the security model which a cryptosystem reaches. In Figure 1.2 on page 21 we can see the relation between these security models. The security level of a cryptographic scheme is usually proved using security games, as the one presented in the end of Section 1.2. In the following two sections we point out some of the areas where quadratic residues are of great interest, focusing mainly on mathematical aspects, Section 1.3, and cryptographic aspects, Section 1.4. In the last section of Chapter 1 we shortly present the literature review regarding mainly four key aspects around which our study shall be structured.
Load more

Recommended publications
  • A Comparitive Study of Asymmetric Key Cryptography
    Vol-5 Issue-3 2019 IJARIIE-ISSN(O)-2395-4396 A COMPARITIVE STUDY OF ASYMMETRIC KEY CRYPTOGRAPHY Dr. Prashant P. Pittalia Associate Professor, Department of Computer Science, Gujarat, India ABSTRACT Cryptography is use to secure the computer networks. Cryptography converts the plain text into cipher text such a way that it is impossible for intruders to read and understand the content. Asymmetric key cryptography is based on the public key and private key concepts to support the confidentiality and authentication services in computer networks. This paper describes how confidentiality and authentication service provides by asymmetric key algorithms. In this paper the discussion and comparison of a asymmetric key algorithms like RSA, Diffie-Hellman, ElGamal and ECC. Keyword: - RSA, Authentication, Public key, Private Key, Confidentiality 1. INTRODUCTION Today in global village the internet security is the challenging aspect and cryptography is used for it. Cryptography is the mathematical techniques of information security. It supports confidentiality, privacy, and data integrity and entity authentication. Cryptography systems classified into two main categories symmetric-key cryptography that use a symmetric key used by both sender and recipient and a public-key cryptography that use two keys, a public key known to everyone in the network and a private key that is used by only the recipient of the messages. Symmetric algorithms use the same secret key for both encryption of plaintext and decryption of cipher text. The keys may be same or there may be an easy transformation to go between the two keys. The key is shared between the two parties (sender and receiver) who want to communicate.
    [Show full text]
  • AUTUMN 2012 8/10/12 13:17 Page 1
    sip AUTUMN 2012 8/10/12 13:17 Page 1 SCIENCE IN PARLIAMENT A proton collides with a proton The Higgs boson appears at last sip AUTUMN 2012 The Journal of the Parliamentary and Scientific Committee www.scienceinparliament.org.uk sip AUTUMN 2012 8/10/12 13:17 Page 2 Physics for All Science and engineering students are important for the future of the UK IOP wants to see more people studying physics www.iop.org / 35 $' 3$5/, $ LQGG sip AUTUMN 2012 8/10/12 13:17 Page 3 Last years's winter of discontent was indeed made SCIENCE IN PARLIAMENT glorious summer by several sons and daughters of York. So many medals in the Olympics were won by scions of Yorkshire that the county claimed tenth place in the medals table, something hard to accept on my side of the Pennines! As well as being fantastic athletic performances the Olympics and Paralympics were stunning demonstrations of the efficiency of UK engineering, and sip the imagination of British science. The Journal of the Parliamentary and Scientific Surely we have good reason to be all eagerly awaiting Andrew Miller MP Committee. Chairman, Parliamentary The Committee is an Associate Parliamentary the announcements from Stockholm of this year's Nobel and Scientific Group of members of both Houses of Prizes? Surely the Higgs boson will be recognised? John Committee Parliament and British members of the European Parliament, representatives of Ellis recently eloquently described the "legacy" of the scientific and technical institutions, industrial hadron collider and we would be missing an important organisations and universities.
    [Show full text]
  • Expertise As an Object: an Ontological Study of Cryptology Research in the United Kingdom from 1970 to 2000
    UNIVERSITY OF SURREY Expertise as an Object: An Ontological Study of Cryptology Research in the United Kingdom from 1970 to 2000 by Richard Fletcher Submitted for the degree of Doctor of Philosophy Faculty of Arts and Human Sciences Department of Sociology Supervisors: Dr Christine Hine and Dr Nicola Green ©Richard Fletcher Words: 95,698 Declaration of Authorship This thesis and the work to which it refers are the results of my own efforts. Any ideas, data, images or text resulting from the work of others (whether published or unpublished) are fully identified as such within the work and attributed to their originator in the text, bibliography or in footnotes. This thesis has not been submitted in whole or in part for any other academic degree or professional qualification. I agree that the University has the right to submit my work to the plagiarism detection service TurnitinUK for originality checks. Whether or not drafts have been so-assessed, the University reserves the right to require an electronic version of the final document (as submitted) for assessment as above. Signature: Date: i \Quis custodiet ipsos custodes?" Juvenal (Satire VI, lines 347-8) Abstract Recent research carried out under the `third wave of science studies' has produced robust categories of expertise, and has developed normative ideas about how it should be used during controversies over technological decision-making. Though separate in the literature, third wave ideas about contributory expertise appear to be compatible with the recent `turn to ontology'. Both sets of ideas focus on what it is that practices are able to produce, and consider the results of those practices to be real.
    [Show full text]
  • Protecting Privacy in Practice
    Protecting privacy in practice The current use, development and limits of Privacy Enhancing Technologies in data analysis Protecting privacy in practice: The current use, development and limits of Privacy Enhancing Technologies in data analysis Issued: March 2019 DES5759 ISBN: 978-1-78252-390-1 The text of this work is licensed under the terms of the Creative Commons Attribution License which permits unrestricted use, provided the original author and source are credited. The license is available at: creativecommons.org/licenses/by/4.0 Images are not covered by this license. This report can be viewed online at: royalsociety.org/topics-policy/projects/privacy- enhancing-technologies Cover image © from2015. CONTENTS Contents Foreword 4 Executive summary 5 Recommendations 6 Summary table 8 Introduction 10 Background – previous Royal Society reports 10 Purpose 11 Target audience 11 Scope 11 Methodology 13 Key terms and definitions 13 Chapter one – Data sensitivity and protections: what are the issues at stake? 17 1.1 Data sensitivity 18 1.2 Privacy risks and the data analysis pipeline 19 1.3 The legal context for data processing: personal data and the GDPR 22 Chapter two – PETs today: capabilities and limitations 25 2.1 PETs and privacy-preserving data analysis 26 2.2 Example PETs, capabilities and limitations 31 2.3 Privacy in practice – Privacy-preserving machine learning 48 Chapter three – The road to adoption 53 3.1 Further research and development 54 3.2 Awareness raising and quality assurance 55 3.3 Adoption within a wider business framework 56 3.4 Consider the wider markets 57 Appendix 59 Index of case studies 60 Working Group members 60 Royal Society staff 61 Reviewers 62 Workshop participants 63 PROtectinG PRIVacY in PRactice 3 FOREWORD Foreword This report comes in the midst of a period here do not achieve their promise in the of rapid developments in the collection, near term, or that the costs of adoption analysis and use of data.
    [Show full text]
  • Quantum Cryptography – a Study Into the Present Technologies and Future Applications
    Next Generation Security Software Quantum Cryptography A study into the present technologies and future applications Bill Grindlay [email protected] 14th January 2003 ©2003 Next Generation Security Software Ltd www.ngssoftware.com “Anyone who is not dizzy after his first acquaintance with the quantum of action has not understood a word.” - Niels Bohr (1885-1962) “When cryptography is outlawed, bayl bhgynjf jvyy unir cevinpl.” - Anonymous 2 3 Contents Introduction .............................................................................................................. 5 A Brief History of Cryptography................................................................................ 6 The Development of Quantum Theory...................................................................... 11 The Advent of Quantum Cryptography..................................................................... 13 Is Quantum Cryptography Secure?.......................................................................... 16 Absolute Security and the Wider Social Issues......................................................... 19 Conclusion.............................................................................................................. 26 4 Introduction In October 1989 at 3 o’clock in the morning at IBM’s Thomas J. Watson Research Centre near New York, Dr. Charles Bennett and a research student named John Smolin witnessed the first ever quantum cryptographic exchange. Using polarised light photons, computers called Alice and Bob successfully
    [Show full text]
  • GCHQ: Britain's Most Secret Intelligence Agency
    5/28/2019 GCHQ: Britain's Most Secret Intelligence Agency GCHQ: Britain's Most Secret Intelligence Agency GCHQ: The Uncensored Story of Britain's Most Secret Intelligence Agency Published by Harper Collins, July 2011 Paperback ISBN 978-0007312665, 32 plates, Pp.666 I last spoke about surveillance at TEDx Warwick. This is here. https://warwick.ac.uk/fac/soc/pais/people/aldrich/vigilant/lectures/gchq/ 1/23 5/28/2019 GCHQ: Britain's Most Secret Intelligence Agency I will be appearing at Digital Dystopias, a Hull City of Culture festival that explores how digital technology is transforming society and shaping our collective futures through award- winning cinema, virtual reality, literature and performance. The panel is "Privacy, Hacktivism and the Politics of Surveillance in a Digital Age" - 6pm on Monday 13th Feb. This is here. You can read my comments about the revelations by Edward Snowden about PRISM and Tempora here. Signals Intelligence History Links >>> GCHQ's History Pages Alan Turing Alan Turnbull's Secret Bases Birgelen Veterans Association Bletchley Park Britain's best-kept WWII Secret CESG History Cipher Machines Timeline Codes and Ciphers in the Second World War Cromwell Cyber Ssecurity Site Crypto Machines Crypto-Museum CSE Canada History https://warwick.ac.uk/fac/soc/pais/people/aldrich/vigilant/lectures/gchq/ 2/23 5/28/2019 GCHQ: Britain's Most Secret Intelligence Agency FAPSI - The Russian Agency GCHQ at FAS.ORG GCSB New Zealand History Page Langeleben (13 Signals Regiment) History Project Lux ex Umbra - Canadian CSE NAVSECGRU
    [Show full text]
  • CS355: Cryptography
    CS355: Cryptography Lecture 17, 18, 19: Public- Key Cryptography.RSA. Attacks against RSA. CS355 Lecture 17/ Spring 2007 1 Public Key Cryptography Overview l Proposed in Diffie and Hellman (1976) “New Directions in Cryptography” ß public-key encryption schemes ß public key distribution systems • Diffie-Hellman key agreement protocol ß digital signature l Public-key encryption was proposed in 1970 by James Ellis ß in a classified paper made public in 1997 by the British Governmental Communications Headquarters l Diffie-Hellman key agreement and concept of digital signature are still due to Diffie & Hellman CS355 Lecture 17/ Spring 2007 3 Public Key Encryption l Public-key encryption ß each party has a PAIR (K, K-1) of keys: K is the public key and K-1 is the private key, such that DK-1[EK[M]] = M ß Knowing the public-key and the cipher, it is computationally infeasible to compute the private key ß Public-key crypto systems are thus known to be asymmetric crypto systems ß The public-key K may be made publicly available, e.g., in a publicly available directory ß Many can encrypt, only one can decrypt CS355 Lecture 17/ Spring 2007 4 Public-Key Encryption Needs One-way Trapdoor Functions l Given a public-key crypto system, ß Alice has public key K ß EK must be a one-way function, knowing y= EK[x], it should be difficult to find x ß However, EK must not be one-way from Alice’s perspective. The function EK must have a trapdoor such that knowledge of the trapdoor enables one to invert it CS355 Lecture 17/ Spring 2007 5 Trapdoor One-way Functions Definition: A function f: {0,1}* Æ {0,1}* is a trapdoor one-way function iff f(x) is a one-way function; however, given some extra information it becomes feasible to compute f-1: given y, find x s.t.
    [Show full text]
  • A Framework for Efficient and Composable Oblivious Transfer
    A Framework for Efficient and Composable Oblivious Transfer Chris Peikert∗ Vinod Vaikuntanathan Brent Watersz SRI International MITy SRI International January 23, 2019 Abstract We propose a simple and general framework for constructing oblivious transfer (OT) protocols that are efficient, universally composable, and generally realizable under any one of a variety of standard number- theoretic assumptions, including the decisional Diffie-Hellman assumption, the quadratic residuosity and decisional composite residuosity assumptions, and worst-case lattice assumptions. Our OT protocols are round-optimal (one message each way), quite efficient in computation and communication, and can use a single common string for an unbounded number of executions between the same sender and receiver. Furthermore, the protocols can provide statistical security to either the sender or the receiver, simply by changing the distribution of the common string. For certain instantiations of the protocol, even a uniformly random common string suffices. Our key technical contribution is a simple abstraction that we call a dual-mode cryptosystem. We implement dual-mode cryptosystems by taking a unified view of several cryptosystems that have what we call “messy” public keys, whose defining property is that a ciphertext encrypted under such a key carries no information (statistically) about the encrypted message. As a contribution of independent interest, we also provide a multi-bit amortized version of Regev’s lattice-based cryptosystem (STOC 2005) whose time and space complexity are improved by a linear factor in the security parameter n. The resulting amortized encryption and decryption times are only O~(n) bit operations per message bit, and the ciphertext expansion can be made as small as a constant; the public key size and underlying lattice assumption remain essentially the same.
    [Show full text]
  • NEWSLETTER No
    NEWSLETTER No. 448 June 2015 SIR CHRISTOPHER ZEEMAN ARCHIVE n 19 March 2015 the London Mathematical Society launched the Sir Christopher Zeeman Archive Otogether with Sir Christopher’s family at a small ceremony at Hertford College, University of Oxford. The online archive represents a lifetime of his work, including letters he wrote, papers and books he published and interviews he gave. Sir Christopher Zeeman is widely considered an icon of modern mathematics and the LMS is delighted to be hosting the archive on its website, particularly as he is a Past President of the Society. His contributions to mathematics range from geometric topology to dynamical systems, with appli- cations across the sciences. He is known among the wider scientific public for his contribution to, and spreading awareness of Catastrophe Theory, and for the 1978 televised Christmas Lectures at the Royal Institution, from which grew the Mathematics Masterclasses for primary and secondary school children that now flourish around the United Kingdom. Professor Terry Lyons, current President of the LMS, paid tribute to Sir Christopher at the ceremony, saying, “Christopher Zeeman’s contribution to mathematical sciences is distinctive for its range, excellence and enormous achievement. It is a real pleasure to congratulate him on his 90th birthday and launch of the archive of his work”. The ceremony was attended by a number of Sir Christopher’s family and friends – including Will Hutton and Walter Bodmer – and to especially mark the occasion a commemorative book was presented to him containing scores of messages and birthday wishes. To access the archive, please visit www.lms.ac.uk/2015/zeeman_archive.
    [Show full text]
  • Trustees' Report and Financial Statements 2015-2016
    TRUSTEES’ REPORT AND FINANCIAL STATEMENTS 1 Trustees’ report and financial statements For the year ended 31 March 2016 2 TRUSTEES’ REPORT AND FINANCIAL STATEMENTS Trustees Executive Director The Trustees of the Society are the Dr Julie Maxton members of its Council, who are elected Statutory Auditor by and from the Fellowship. Council is Deloitte LLP chaired by the President of the Society. Abbots House During 2015/16, the members of Council Abbey Street were as follows: Reading President RG1 3BD Sir Paul Nurse* Bankers Sir Venki Ramakrishnan** The Royal Bank of Scotland Treasurer 1 Princes Street Professor Anthony Cheetham London EC2R 8BP Physical Secretary Professor Alexander Halliday Investment Managers Rathbone Brothers PLC Foreign Secretary 1 Curzon Street Sir Martyn Poliakoff CBE London Biological Secretary W1J 5FB Sir John Skehel Internal Auditors Members of Council PricewaterhouseCoopers LLP Sir John Beddington CMG* Cornwall Court Professor Andrea Brand 19 Cornwall Street Sir Keith Burnett** Birmingham Professor Michael Cates B3 2DT Dame Athene Donald DBE* Professor George Efstathiou** Professor Brian Foster** Professor Carlos Frenk* Registered Charity Number 207043 Professor Uta Frith DBE Registered address Professor Joanna Haigh 6 – 9 Carlton House Terrace Dame Wendy Hall DBE London SW1Y 5AG Dr Hermann Hauser Dame Frances Kirwan DBE* royalsociety.org Professor Ottoline Leyser CBE* Professor Angela McLean Dame Georgina Mace CBE Professor Roger Owen* Dame Nancy Rothwell DBE Professor Stephen Sparks CBE Professor Ian Stewart Dame Janet Thornton DBE Professor Cheryll Tickle** Dr Richard Treisman** Professor Simon White** * Until 30 November 2015 ** From 30 November 2015 Cover image Tadpoles overhead by Bert Willaert, Belgium. TRUSTEES’ REPORT AND FINANCIAL STATEMENTS 3 Contents President’s foreword ...............................................
    [Show full text]
  • Chosen-Ciphertext Security from Identity-Based Encryption
    Chosen-Ciphertext Security from Identity-Based Encryption Ran Canetti1, Shai Halevi1, and Jonathan Katz2 1 IBM T. J. Watson Research Center, Hawthorne, NY. {canetti,shaih}@watson.ibm.com 2 Dept. of Computer Science, University of Maryland, College Park, MD. [email protected] Abstract. We propose a simple and efficient construction of a CCA- secure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction requires the underlying IBE scheme to satisfy only a relatively “weak” notion of security which is known to be achievable without random oracles; thus, our results pro- vide a new approach for constructing CCA-secure encryption schemes in the standard model. Our approach is quite different from existing ones; in particular, it avoids non-interactive proofs of “well-formedness” which were shown to underlie most previous constructions. Furthermore, ap- plying our conversion to some recently-proposed IBE schemes results in CCA-secure schemes whose efficiency makes them quite practical. Our technique extends to give a simple and reasonably efficient method for securing any binary tree encryption (BTE) scheme against adaptive chosen-ciphertext attacks. This, in turn, yields more efficient CCA-secure hierarchical identity-based and forward-secure encryption schemes in the standard model. Keywords: Chosen-ciphertext security, Forward-secure encryption, Identity- based encryption, Public-key encryption. 1 Introduction Security against adaptive chosen-ciphertext attacks (i.e., “CCA security”) is a strong and very useful notion of security for public-key encryption schemes [rs91, ddn00, bdpr98] . This notion is known to suffice for many applications of encryption in the presence of active attackers, including secure communication, auctions, voting schemes, and many others.
    [Show full text]
  • Cryptography 11
    Privacy on the Line The right of the people to be secure in their persons, houses, papers and effects against unreasonable searches and seizures shall not be violated, and no Warrants shall issue but upon probable cause, supported by Oath or affirmation, and particularly describing the place to be searched, and the persons or things to be seized. Fourth Amendment United States Constitution The evil incident to invasion of privacy of the telephone is far greater than that involved in tampering with the mails. Whenever a telephone line is tapped, the privacy of persons at both ends of the line is invaded, and all conversations between them upon any subject, and although proper, confidential and privileged, may be overheard. Moreover, the tapping of one man’s telephone line involves the tapping of the telephone of every other person whom he may call or who may call him. As a means of espi- onage, writs of assistance and general warrants are but puny instruments of tyranny and oppression when compared with wire-tapping. Justice Louis Brandeis dissenting opinion in Olmstead v. United States (277 US 438, 1928, pp. 475–476) Senator Herman Talmadge: Do you remember when we were in law school, we studied a famous principle of law that came from England and also is well known in this country, that no matter how humble a man’s cottage is, that even the King of England cannot enter without his consent. Witness John Ehrlichman: I am afraid that has been considerably eroded over the years, has it not? Senator Talmadge: Down in my country we still think of it as a pretty legitimate piece of law.
    [Show full text]