DOCSLIB.ORG

Improved Short Lattice Signatures in the Standard Model

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Improved Short Lattice Signatures in the Standard Model Improved Short Lattice Signatures in the Standard Model L´eoDucas and Daniele Micciancio University of California, San Diego flducas,[email protected] Abstract We present a signature scheme provably secure in the standard model (no random oracles) based on the worst-case complexity of approximating the Shortest Vector Problem in ideal lattices within polynomial factors. The distinguishing feature of our scheme is that it achieves short signatures (consisting of a single lattice vector), and relatively short public keys (consisting of O(log n) vectors.) Previous lattice schemes in the standard model with similarly short signatures, due to Boyen (PKC 2010) and Micciancio and Peikert (Eurocrypt 2012), had substantially longer public keys consisting of Ω(n) vectors (even when implemented with ideal lattices). We also present a variant of our scheme that further reduces the public key size to just O(log log n) vectors and allows for a tighther security proof by making the signer stateful. 1 Introduction Lattice based cryptography [Ajt04, AD97], originally an area of primarily theoretical interest, has seen a tremendous growth during the last decade, due both to substantial efficiency improvements obtainable using lattices with algebraic structure [HPS98, Mic07], and to the enormous versatility afforded by the Learning with Errors (LWE) problem [Reg09]. One of the problems that has received most attention so far, is that of lattice based signatures [LM08a, GPV08, Lyu09, Boy10, R¨uc10,GLP12, Lyu12, DDLL13, BG14]. From a theoretical point of view, digital signatures can be constructed from any one-way function [Rom90, Lam79]. So, the existence of digital signature schemes based on the hardness of lattice problems directly follows from Ajtai's seminal work [Ajt04]. But generic constructions are rather inefficient. Inputs and outputs of lattice based cryptographic functions typically consist of one or more Ω(~ n)-dimensional vectors, where n is the security parameter. Generic digital signature constructions require n parallel applications of a one-way function. So, even if each one-way function takes as input a single vector, the resulting digital siguatures consist of n vectors, and require Ω(~ n2) storage even when using algebraic lattices [Mic07]. So, finding efficient constructions of signatures directly based on hard lattice problems has been an important problem since the early days of lattice cryptography, with the main goal of finding \short" signatures, i.e., lattice signatures consisting of a single lattice vector. The first direct constructions of lattice signatures were given in [LM08a] and [GPV08]. Both schemes achieved \short" signatures, consisting of a single lattice vector, but each work had its own pros and cons. On the one hand [LM08a] gave a scheme provably secure in the standard model of computation, and with very simple signing/verification procedures, but only provided a direct construction of one-time signatures: digital signature schemes that can be used to sign a single message. Such schemes can be turned into general purpose signature schemes with only a logarithmic loss in efficiency using standard tree constructions. However, these transformations can be quite expensive in practice, because they lead to signatures consisting of O(log n) vectors. Given that signature size is often the most critical efficiency parameter affecting the practicality of a scheme, such signatures can no longer be considered \short". On the other hand, [GPV08] gave a scheme that allowed to produce short signatures for arbitrarily many messages, but only offered heuristic security in the random oracle model. Moreover, the scheme of [GPV08] was not entirely practical, involving a rather 1 complex signing algorithm based on sampling lattice vectors with gaussian distribution, a problem that only recently has found more satisfactory solutions [MP12]. Two lines of research have evolved from [GPV08], trying to address either the security or efficiency limitations of that work: • A first line of research [Lyu09, Lyu12, GLP12, DDLL13, BG14, HPS+13] kept investigating lattice sig- nature in the random oracle model, with the goal of achieving the highest possible levels of performance, and schemes that are efficient enough to be used in practice. • A second line of work, [CHKP12, Boy10, MP12] kept pursuing the important goal of obaining security in the standard model of computation (no random oracles) while at the same time improving the efficiency and potential practicality of previous schemes. Our work is part of this second line of research, which we describe in more detail. The current state of the art, when it comes to short lattice signatures in the standard model, is given by the scheme of Boyen [Boy10], with additional security and efficiency improvements described in [MP12]. This scheme achieved the important goal of \short" lattice signatures (consisting of a single lattice vector), without resorting to the random oracle model. The main drawback of this scheme was the huge public key involved. Lattice public keys, even in the random oracle model [GPV08, Lyu09, Lyu12, GLP12, DDLL13, BG14], consist of one or more n × m matrices, each of which typically requires Ω(~ n2) storage. For the sake of comparison, we consider natural adaptations of [CHKP12, Boy10, MP12] to the algebraic/ring setting, where n × m matrices can be implicitly described by a single m-dimensional vector. Going back to the signature scheme of [Boy10, MP12], public keys consist of Ω(n) matrices, and therefore require at least quadratic Ω(~ n2) total storage even when using \compact" algebraic lattices. We remark that digital signature schemes can be efficiently constructed out of identity based encryption (IBE) by using ciphertexts as signatures, and lattice based IBE with short ciphertexts are also known [CHKP12, ABB10b, ABB10a]. However, lattice IBE schemes are built on top of the signature techniques from [CHKP12, Boy10], and bear the same limitations when it comes to public key size: lattice IBE [CHKP12, ABB10b, ABB10a] use public keys consisting of Ω(n) matrices, and result in Ω(~ n2) or even Ω(~ n3) pubic key size depending on the type of lattices employed. Reducing the size of, not only the signatures, but also the public key, was the main open problem left by [CHKP12, Boy10, MP12, ABB10b, ABB10a]. We remark that the last few years have seen major efficiency progress on lattice signatures in the random oracle model [GPV08, Lyu09, Lyu12, GLP12, DDLL13, BG14], leaving a substantial gap between random oracle and standard model signatures. Still, designing efficient signature schemes without random oracles is an important and well established problem, both for the theory and practice of cryptography. A recent work in this direction is the paper of Bohl et al. [BHJ+13a, BHJ+13b, Seo12], which formalized1 a general “confined guessing" technique applicable to a variety of (not only lattice) settings. Here we describe their results, limited to the case of lattice signatures, and specialized to algebraic/ring lattices. Among other things, [BHJ+13a] gives a standard model lattice signature with public keys consisting of a single matrix, and therefore requiring only O(m) = Ω(~ n) storage when using algebraic/ring lattices. However, this comes at a substantial cost in terms of signature size: the digital signatures of [BHJ+13a] consist of O(log n) vectors. While a O(log n) increase may not seem much, it is quite a high cost when it comes to signature size, both in theory and in practice. In fact, a similar trade-off was already known since the very first direct construction of lattice signatures [LM08a], which, as alredy discussed, produced general signatures consisting of O(log n) vectors (as well as short public keys). In other words, just like [LM08a], the lattice signatures of [BHJ+13a] are not \short". (The main contribution of [BHJ+13a] over the classic scheme of [LM08a], is that the results of [BHJ+13a] also apply to general lattices.) Our results. We present the first standard model construction of short signatures based on (algebraic/ring) lattices with relatively small public keys: Similarly to [Boy10, MP12], we achieve signatures consisting of a single vector without resorting to random oracles. At the same time, we substantially reduce the public key size from the Ω(n) vectors2 of previously best short lattice signatures [Boy10, MP12] to just O(log n) 1The technique first appeared in the work of Hohenberger and Waters [HW09b, HW09a] and was also used in [BK10]. 2 Remember we are in the ring setting, so only one vector is required to represent each matrix. 2 Scheme Pub. Key Secret Key Signature Reduction SIS parameter β 1×k k×k k Rq mat. Rq mat. Rq vec. loss [GPV08](ROM) 1 1 1 1 Ω(~ n) [LM08a](Trees) 1 1 log n Q Ω(~ n2) [CHKP12] n n n Q Ω(~ n3=2) [Boy10, MP12] n n 1 Q Ω(~ n7=2), Ω(~ n5=2) + 2 c ~ 5=2 [BHJ 13a] 1 1 logc n O(Q /) Ω(n ) 2 c ~ 7=2 Stateless Scheme (Sec. 3) logc n logc n 1 O(Q /) Ω(n ) c ~ 3=2 Stateful Scheme (Sec. 4.1) 2 logc(log n) 2 logc(log n) 1 2Q Ω(n ) O(1) Rq = Zq[X]=f(X) for some (cyclotomic) polynomial f of degree n, q = n , and k = O(log q). Q denotes the number of signature queries made by the attacker and is its success probability. The value c > 1 is an arbitrary constant that governs the security/efficiency trade off. The reduction loss is the ratio 0/ between the success probability 0 of the reduction and the success probability of the attacker. Figure 1: Comparison to previous work on lattice signatures in the ring setting. vectors. Our scheme is stateless, i.e., all signatures can be produced independently by running the signing algorithm on input the secret key and message to be signed.
Load more

Recommended publications
  • Hash Functions from Sigma Protocols and Improvements to VSH
    Hash Functions from Sigma Protocols and Improvements to VSH Mihir Bellare and Todor Ristov Department of Computer Science and Engineering, University of California San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0404, USA. URL: www-cse.ucsd.edu/users/mihir, www-cse.ucsd.edu/users/tristov Abstract. We present a general way to get a provably collision-resistant hash function from any (suitable) Σ-protocol. This enables us to both get new designs and to unify and improve previous work. In the first category, we obtain, via a modified version of the Fiat-Shamir proto- col, the fastest known hash function that is provably collision-resistant based on the standard factoring assumption. In the second category, we provide a modified version VSH* of VSH which is faster when hash- ing short messages. (Most Internet packets are short.) We also show that Σ-hash functions are chameleon, thereby obtaining several new and efficient chameleon hash functions with applications to on-line/off-line signing, chameleon signatures and designated-verifier signatures. 1 Introduction The failure of popular hash functions MD5 and SHA-1 [42, 43] lends an impetus to the search for new ones. The contention of our paper is that there will be a \niche" market for proven-secure even if not-so-fast hash functions. Towards this we provide a general paradigm that yields hash functions provably secure under number-theoretic assumptions, and also unifies, clarifies and improves previous constructs. Our hash functions have extra features such as being chameleon [25]. Let us now look at all this in more detail.
    [Show full text]
  • SSS) Operational Records, 2008-2016
    Description of document: Six (6) Selective Service System (SSS) operational records, 2008-2016 Requested date: January 2017 Released date: 31-January-2017 Posted date: 13-February-2017 Source of document: FOIA Request FOIA Officer Selective Service System National Headquarters Arlington, VA 22209-2425 The governmentattic.org web site (“the site”) is noncommercial and free to the public. The site and materials made available on the site, such as this file, are for reference only. The governmentattic.org web site and its principals have made every effort to make this information as complete and as accurate as possible, however, there may be mistakes and omissions, both typographical and in content. The governmentattic.org web site and its principals shall have neither liability nor responsibility to any person or entity with respect to any loss or damage caused, or alleged to have been caused, directly or indirectly, by the information provided on the governmentattic.org web site or in this file. The public records published on the site were obtained from government agencies using proper legal channels. Each document is identified as to the source. Any concerns about the contents of the site should be directed to the agency originating the document in question. GovernmentAttic.org is not responsible for the contents of documents published on the website. January 31, 2017 This is in response to your Freedom of Information email request dated January, 2017 requesting a digital/electronic copy of the Selective Service System’s following records: 1 Agency National Readiness Plan 2 Call and Deliver Plan 3 Reclassify Plan 4 Alternative Service Plan 5 Lottery Standard Operating Procedures/Plan 6 SSS Fiscal Manual Please note that rather than a Reclassify “Plan” we have a Reclassify “Standard Operating Procedure”.
    [Show full text]
  • Automated Malware Analysis Report for FAKE SSS ID-Pdf
    ID: 214287 Sample Name: FAKE SSS ID- pdf.exe Cookbook: default.jbs Time: 14:43:07 Date: 10/03/2020 Version: 28.0.0 Lapis Lazuli Table of Contents Table of Contents 2 Analysis Report FAKE SSS ID-pdf.exe 4 Overview 4 General Information 4 Detection 4 Confidence 5 Classification Spiderchart 5 Analysis Advice 6 Mitre Att&ck Matrix 6 Signature Overview 7 AV Detection: 7 Spreading: 7 Networking: 7 Key, Mouse, Clipboard, Microphone and Screen Capturing: 8 System Summary: 8 Data Obfuscation: 8 Persistence and Installation Behavior: 8 Hooking and other Techniques for Hiding and Protection: 8 Malware Analysis System Evasion: 9 Anti Debugging: 9 HIPS / PFW / Operating System Protection Evasion: 9 Language, Device and Operating System Detection: 9 Stealing of Sensitive Information: 9 Remote Access Functionality: 9 Malware Configuration 9 Behavior Graph 10 Simulations 10 Behavior and APIs 10 Antivirus, Machine Learning and Genetic Malware Detection 10 Initial Sample 10 Dropped Files 10 Unpacked PE Files 10 Domains 11 URLs 11 Yara Overview 11 Initial Sample 11 PCAP (Network Traffic) 11 Dropped Files 11 Memory Dumps 11 Unpacked PEs 11 Sigma Overview 11 Joe Sandbox View / Context 11 IPs 11 Domains 11 ASN 12 JA3 Fingerprints 12 Dropped Files 12 Screenshots 12 Thumbnails 12 Startup 13 Created / dropped Files 13 Domains and IPs 18 Contacted Domains 18 URLs from Memory and Binaries 18 Contacted IPs 19 Static File Info 19 General 19 File Icon 19 Static PE Info 19 Copyright Joe Security LLC 2020 Page 2 of 36 General 19 Entrypoint Preview 20 Rich Headers 21
    [Show full text]
  • Threshold Cryptography Based on Blakley Secret Sharing
    Threshold Cryptography Based on Blakley Secret Sharing Ilker˙ Nadi Bozkurt, Kamer Kaya, Ali Aydın Selc¸uk Ahmet M. Gulo¨ glu˜ Department of Computer Engineering Department of Mathematics Bilkent University Bilkent University Ankara, 06800, Turkey Ankara, 06800, Turkey Email: bozkurti,kamer,selcuk @cs.bilkent.edu.tr Email: [email protected] f g Abstract—Function sharing deals with the problem and Asmuth-Bloom [1] based on the Chinese Remainder of distribution of the computation of a function (such Theorem. as decryption or signature) among several parties. The A shortcoming of secret sharing schemes is the need to necessary values for the computation are distributed to reveal the secret shares during the reconstruction phase. the participating parties using a secret sharing scheme The system would be more secure if the subject function (SSS). Several function sharing schemes have been pro- posed in the literature, with most of them using Shamir can be computed without revealing the secret shares or secret sharing as the underlying SSS. In this paper, we reconstructing the secret. This is known as the function investigate how threshold cryptography can be conducted sharing problem. A function sharing scheme requires with Blakley secret sharing scheme and present a novel distributing the function’s computation according to the function sharing scheme for the RSA cryptosystem. The underlying SSS such that each part of the computation challenge is that constructing the secret in Blakley’s SSS can be carried out by a different user and then the requires the solution of a linear system which normally partial results can be combined to yield the function’s involves computing inverses, while computing inverses value without disclosing the individual secrets.
    [Show full text]
  • VPC-SI System Administration Guide, Staros Release 21.20
    VPC-SI System Administration Guide, StarOS Release 21.20 First Published: 2020-06-30 Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS (6387) Fax: 408 527-0883 THE SPECIFICATIONS AND INFORMATION REGARDING THE PRODUCTS IN THIS MANUAL ARE SUBJECT TO CHANGE WITHOUT NOTICE. ALL STATEMENTS, INFORMATION, AND RECOMMENDATIONS IN THIS MANUAL ARE BELIEVED TO BE ACCURATE BUT ARE PRESENTED WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED. USERS MUST TAKE FULL RESPONSIBILITY FOR THEIR APPLICATION OF ANY PRODUCTS. THE SOFTWARE LICENSE AND LIMITED WARRANTY FOR THE ACCOMPANYING PRODUCT ARE SET FORTH IN THE INFORMATION PACKET THAT SHIPPED WITH THE PRODUCT AND ARE INCORPORATED HEREIN BY THIS REFERENCE. IF YOU ARE UNABLE TO LOCATE THE SOFTWARE LICENSE OR LIMITED WARRANTY, CONTACT YOUR CISCO REPRESENTATIVE FOR A COPY. The Cisco implementation of TCP header compression is an adaptation of a program developed by the University of California, Berkeley (UCB) as part of UCB's public domain version of the UNIX operating system. All rights reserved. Copyright © 1981, Regents of the University of California. NOTWITHSTANDING ANY OTHER WARRANTY HEREIN, ALL DOCUMENT FILES AND SOFTWARE OF THESE SUPPLIERS ARE PROVIDED “AS IS" WITH ALL FAULTS. CISCO AND THE ABOVE-NAMED SUPPLIERS DISCLAIM ALL WARRANTIES, EXPRESSED OR IMPLIED, INCLUDING, WITHOUT LIMITATION, THOSE OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OR ARISING FROM A COURSE OF DEALING, USAGE, OR TRADE PRACTICE. IN NO EVENT SHALL CISCO OR ITS SUPPLIERS BE LIABLE FOR ANY INDIRECT, SPECIAL, CONSEQUENTIAL, OR INCIDENTAL DAMAGES, INCLUDING, WITHOUT LIMITATION, LOST PROFITS OR LOSS OR DAMAGE TO DATA ARISING OUT OF THE USE OR INABILITY TO USE THIS MANUAL, EVEN IF CISCO OR ITS SUPPLIERS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
    [Show full text]
  • Cryptography in Context
    Cryptography in Context Cryptography in Context Gerard Tel iv Contents Contents v Preface ix 1 On the Secure Hash Algorithm family (Wouter Penard and Tim van Werkhoven) 1 1.1 Introduction . 1 1.2 Description of the SHA Algorithms . 4 1.3 Generic Attacks . 8 1.4 Specialized Attacks . 13 1.5 Implications of Attacks . 17 1.6 Conclusion . 17 2 Security and privacy of RFID tags (Jeroen van Wolffelaar) 19 2.1 RFID tags . 19 2.2 Case: Baja Beach Club . 20 2.3 Case: Biometric passports . 22 2.4 Case: OV-chipkaart . 24 2.5 Conclusions . 27 3 Xbox Securtity (Miloslav Valco) 29 3.1 Microsoft's Financial Gambles . 29 3.2 Andrew "bunnie" Huang . 31 3.3 RC4 . 33 3.4 Tiny Encryption Algorithm . 35 3.5 The Visor Hack . 36 3.6 Xbox Linux Project . 36 3.7 Discussion and conclusion . 37 4 Multiple Encryption (Ronald Chu & Mark Jeronimus) 39 4.1 Introduction . 39 4.2 definitions . 40 4.3 Known attacks . 40 4.4 Applications . 45 4.5 Summary and conclusions . 47 v vi Contents 5 Phishing (Marnix Kammer and Barbara Pieters) 49 5.1 Phishing and cryptography . 49 5.2 Forms of phishing . 50 5.3 Changes in human-computer interaction to prevent phishing . 53 5.4 Technical solutions to prevent phishing . 56 5.5 Summary and conclusions . 64 6 Electronic Voting 2.0 (Jeiel Schalkwijk) 67 6.1 The current state of voting machines . 67 6.2 Cryptographic systems . 70 6.3 ThreeBallot . 71 6.4 Moran and Naor's protocol . 72 6.5 Conclusion .
    [Show full text]
  • SSS-V2: Secure Similarity Search Hyun-A Park
    1 SSS-V2: Secure Similarity Search Hyun-A Park Abstract—Encrypting information has been regarded as one of the most substantial approaches to protect users’ sensitive information in radically changing internet technology era. In prior research, researchers have considered similarity search over encrypted documents infeasible, because the single-bit difference of a plaintext would result in an enormous bits difference in the corresponding ciphertext. However, we propose a novel idea of Security Similarity Search (SSS) over encrypted documents by applying character-wise encryption with approximate string matching to keyword index search systems. In order to do this, we define the security requirements of similarity search over encrypted data, propose two similarity search schemes, and formally prove the security of the schemes. The first scheme is more efficient, while the second scheme achieves perfect similarity search privacy. Surprisingly, the second scheme turns out to be faster than other keyword index search schemes with keyword- wise encryption, while enjoying the same level of security. The schemes of SSS support “like query(‘ab%’)” and a query with misprints in that the character-wise encryption preserves the degree of similarity between two plaintexts, and renders approximate string matching between the corresponding ciphertexts possible without decryption. Index Terms—keyword index search, encrypted data, similarity search, character-wise encryption, approximate string matching, hamming distance F 1 INTRODUCTION approximate string matching test. However, simple character-wise N the rapidly developing internet technology era, the amount of encryption is vulnerable to a dictionary attack because the domain I sensitive information radically increases and the information is is too small.
    [Show full text]
  • Bestcrypt Container Encryption Help File
    BestCrypt Container Encryption Help File Introduction Introduction Why do you need BestCrypt? Benefits of BestCrypt BestCrypt Requirements BestCrypt Specifications and Limitations 2 Introduction The BestCrypt Data Encryption system provides the most comprehensive and easy-to-use secure data storage and access control facilities available. BestCrypt’s data encryption method uses encryption algorithms known world-wide and provides unparalleled protection against unauthorized data access. BestCrypt is easy to install, easy to use and totally transparent for application programs. Your data is BestCrypt’s only concern, and it enhances your basic right to keep documents, commercial proprietary knowledge, and private information, in a confidential fashion. See also: Benefits of BestCrypt BestCrypt Requirements BestCrypt Specifications and Limitations 3 Why do you need BestCrypt? BestCrypt is oriented to a wide range of users. Whether you are in business and work with an accounts database, or you are a developer who is designing a new product, or you keep your private correspondence on your computer, you will appreciate a security system that restricts access to your data. With the advent of mass storage systems, a tremendous amount of information can be carried conveniently on even a small notebook computer. What happens to all this information if the computer is stolen at an airport? Suppose someone gains access to your computer without your knowledge. Do you know if your data has been copied and given to someone else? What about the information retained on floppy disks? On portable hard drives? On network drives, where administrators and maybe others can read all unencrypted files? Of course, there are a number of security systems offered for computers, but here is the most important point: The main advantage of BestCrypt is that it is the most powerful, proven protection tool, based on cutting-edge technology, and available now for public use.
    [Show full text]
  • Progress on Cryptography
    PROGRESS ON CRYPTOGRAPHY 25 Years of Cryptography in China THE KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE PROGRESS ON CRYPTOGRAPHY 25 Years of Cryptography in China edited by Kefei Chen Shanghai Jiaotong University China KLUWER ACADEMIC PUBLISHERS NEW YORK, BOSTON, DORDRECHT, LONDON, MOSCOW eBook ISBN: 1-4020-7987-7 Print ISBN: 1-4020-7986-9 ©2004 Kluwer Academic Publishers New York, Boston, Dordrecht, London, Moscow Print ©2004 Kluwer Academic Publishers Boston All rights reserved No part of this eBook may be reproduced or transmitted in any form or by any means, electronic, mechanical, recording, or otherwise, without written consent from the Publisher Created in the United States of America Visit Kluwer Online at: http://kluweronline.com and Kluwer's eBookstore at: http://ebooks.kluweronline.com International Workshop on Progress on Cryptography Organized by Department of Computer Science and Engineering, SJTU In cooeration with National Natural Science Foundation of China (NSFC) Aerospace Information Co., Ltd. Workshop Co-Chairs Kefei Chen (Shanghai Jiaotong University, China) Dake He (Southwest Jiaotong University, China) Program committee Kefei Chen (Chair, Shanghai Jiaotong University, China) Lidong Chen (Motorola Inc., USA) Cunsheng Ding (HKUST, Hong Kong, China) Dengguo Feng (Chinese Academy of Sciences, China) Guang Gong (University of Waterloo, Canada) Dake He (Southwest Jiaotong University, China) Xuejia Lai (S.W.I.S. GROUP, Switzerland) Bazhong Shen, (Broadcom Corp., USA) Huafei Zhu (Institute for Infocomm
    [Show full text]
  • Chosen-Ciphertext Attacks Against MOSQUITO
    Chosen-Ciphertext Attacks against MOSQUITO Antoine Joux1,3 and Fr´ed´eric Muller2 1 DGA 2 HSBC-France [email protected] 3 Universit´ede Versailles-Saint-Quentin, France [email protected] Abstract. Self-Synchronizing Stream Ciphers (SSSC) are a particular class of symmetric encryption algorithms, such that the resynchroniza- tion is automatic, in case of error during the transmission of the cipher- text. In this paper, we extend the scope of chosen-ciphertext attacks against SSSC. Previous work in this area include the cryptanalysis of dedi- cated constructions, like KNOT, HBB or SSS. We go further to break the last standing dedicated design of SSSC, i.e. the ECRYPT proposal MOSQUITO. Our attack costs about 270 computation steps, while a 96-bit security level was expected. It also applies to Γ Υ (an ancestor of MOSQUITO) therefore the only secure remaining SSSC are block- cipher-based constructions. 1 Introduction Symmetric encryption algorithms are generally split in two parts : stream ciphers and block ciphers. On the one hand, stream ciphers manipulate the plaintext by short packets of data (for instance bit per bit), using a time-dependent transform. Typically the output of a PRNG (Pseudo-Random Number Gener- ator) is XORed to the plaintext. On the other hand, block ciphers manipulate the plaintext by larger packets of data (typically 128 bits for AES [17]) using a fixed transform. Self-Synchronizing Stream Ciphers (SSSC) are a special primitive : they are often considered as a simple subclass of stream ciphers, but there are also some similarities with block ciphers. Their main property is that, when some error occurs in the transmission of the ciphertext, the decryption algorithm eventually corrects it, after a short sequence of incorrectly decrypted bits.
    [Show full text]
  • Lightweight Password Hashing Scheme for Embedded Systems
    Lightweight Password Hashing Scheme for Embedded Systems George Hatzivasilis1, Ioannis Papaefstathiou1, Charalampos Manifavas2, and Ioannis Askoxylakis3 1 Dept. of Electronic & Computer Engineering, Technical University of Crete, Chania, Crete, Greece [email protected], [email protected] 2 Dept. of Informatics Engineering, Technological Educational Institute of Crete, Heraklion, Crete, Greece [email protected] 3 Foundation for Research and Technology { Hellas (FORTH), Heraklion, Crete, Greece [email protected] Abstract. Passwords constitute the main mean for authentication in computer systems. In order to maintain the user-related information at the service provider end, password hashing schemes (PHS) are uti- lized. The limited and old-fashioned solutions led the international cryp- tographic community to conduct the Password Hashing Competition (PHC). The competition will propose a small portfolio of schemes suit- able for widespread usage until 2015. Embedded systems form a spe- cial application domain, utilizing devices with inherent computational limitations. Lightweight cryptography focuses in designing schemes for such devices and targets moderate levels of security. In this paper, a lightweight poly PHS suitable for lightweight cryptography is presented. At first, we design two lightweight versions of the PHC schemes Catena and PolyPassHash. Then, we integrate them and implement the proposed scheme { called LightPolyPHS. The schemes are applied on a MANET with BeagleBone embedded devices and a fair comparison with similar proposals on mainstream computer is presented. Keywords: password hashing · PHC · Catena · PolyPassHash · lightweight cryptography · LWC · embedded systems · BeagleBone 1 Introduction Attacks on widely known organizations, like SONY [1] and LinkedIn [2], have exposed mounts of user accounts and credentials. The poor password protection practises [3] are exploited by the attackers in order to recover the user passwords from the stolen data.
    [Show full text]
  • Rocca: an Efficient AES-Based Encryption Scheme for Beyond 5G
    IACR Transactions on Symmetric Cryptology ISSN 2519-173X, Vol. 2021, No. 2, pp. 1–30. DOI:10.46586/tosc.v2021.i2.1-30 Rocca: An Efficient AES-based Encryption Scheme for Beyond 5G Kosei Sakamoto1 and Fukang Liu1,2 and Yuto Nakano3 and Shinsaku Kiyomoto3 and Takanori Isobe1,4,5 1 University of Hyogo, Kobe, Japan. [email protected], [email protected], [email protected] 2 East China Normal University, Shanghai, China 3 KDDI Research, Fujimino, Japan. [email protected], [email protected] 4 National Institute of Information and Communications Technology (NICT), Tokyo, Japan 5 PRESTO, Japan Science and Technology Agency, Tokyo, Japan Abstract. In this paper, we present an AES-based authenticated-encryption with associated-data scheme called Rocca, with the purpose to reach the requirements on the speed and security in 6G systems. To achieve ultra-fast software implementations, the basic design strategy is to take full advantage of the AES-NI and SIMD instructions as that of the AEGIS family and Tiaoxin-346. Although Jean and Nikolić have generalized the way to construct efficient round functions using only one round of AES (aesenc) and 128-bit XOR operation and have found several efficient candidates, there still seems to exist potential to further improve it regarding speed and state size. In order to minimize the critical path of one round, we remove the case of applying both aesenc and XOR in a cascade way for one round. By introducing a cost-free block permutation in the round function, we are able to search for candidates in a larger space without sacrificing the performance.
    [Show full text]