On security arguments of the second round SHA-3 candidates View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2012-02-11

AUTHORS

Elena Andreeva, Andrey Bogdanov, Bart Mennink, Bart Preneel, Christian Rechberger

ABSTRACT

In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities like differential attacks identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. 14 candidates were left in the second round, out of which five candidates have been recently chosen for the final round. An important criterion in the selection process is the SHA-3 hash function security. We identify two important classes of security arguments for the new designs: (1) the possible reductions of the hash function security to the security of its underlying building blocks and (2) arguments against differential attack on building blocks. In this paper, we compare the state of the art provable security reductions for the second round candidates and review arguments and bounds against classes of differential attacks. We discuss all the SHA-3 candidates at a high functional level, analyze, and summarize the security reduction results and bounds against differential attacks. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered. More... »

PAGES

103-120

References to SciGraph publications

  • 2006. Strengthening Digital Signatures Via Randomized Hashing in ADVANCES IN CRYPTOLOGY - CRYPTO 2006
  • 2001-12-04. The Wide Trail Design Strategy in CRYPTOGRAPHY AND CODING
  • 2011. Improved Security Analysis of Fugue-256 (Poster) in INFORMATION SECURITY AND PRIVACY
  • 2005. On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2008. Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA? in APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
  • 2004. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance in FAST SOFTWARE ENCRYPTION
  • 2011. Security Analysis of SIMD in SELECTED AREAS IN CRYPTOGRAPHY
  • 1991. Differential Cryptanalysis of DES-like Cryptosystems in ADVANCES IN CRYPTOLOGY-CRYPT0’ 90
  • 2011. Cryptanalysis of Luffa v2 Components in SELECTED AREAS IN CRYPTOGRAPHY
  • 2013. Provable Security of BLAKE with Non-ideal Compression Function in SELECTED AREAS IN CRYPTOGRAPHY
  • 2008-01-01. Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions in ADVANCES IN CRYPTOLOGY – CRYPTO 2008
  • 2009. Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions in PROGRESS IN CRYPTOLOGY - INDOCRYPT 2009
  • 1993. Hash Functions Based on Block Ciphers in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 92
  • 2009-05-09. Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers in COMPUTING
  • 2010. Stam’s Collision Resistance Conjecture in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2010
  • 2007-01-01. Seven-Property-Preserving Iterated Hashing: ROX in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2007
  • 2010. On the Indifferentiability of the Grøstl Hash Function in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2009. Blockcipher-Based Hashing Revisited in FAST SOFTWARE ENCRYPTION
  • 2006. Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2006
  • 2011. Security Reductions of the Second Round SHA-3 Candidates in INFORMATION SECURITY
  • <error retrieving object. in <ERROR RETRIEVING OBJECT
  • 1996. Keying Hash Functions for Message Authentication in ADVANCES IN CRYPTOLOGY — CRYPTO ’96
  • 1990. One Way Hash Functions and DES in ADVANCES IN CRYPTOLOGY — CRYPTO’ 89 PROCEEDINGS
  • 2005. Second Preimages on n-Bit Hash Functions for Much Less than 2n Work in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2010. Security Analysis of the Mode of JH Hash Function in FAST SOFTWARE ENCRYPTION
  • 2005. How to Break MD5 and Other Hash Functions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2009. Salvaging Merkle-Damgård for Practical Applications in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2009
  • 2012. Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein in PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2012
  • 2005. Finding Collisions in the Full SHA-1 in ADVANCES IN CRYPTOLOGY – CRYPTO 2005
  • 2009. Characterizing Padding Rules of MD Hash Functions Preserving Collision Security in INFORMATION SECURITY AND PRIVACY
  • 2009. Cryptanalysis of Tweaked Versions of SMASH and Reparation in SELECTED AREAS IN CRYPTOGRAPHY
  • 2002-09-13. Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV in ADVANCES IN CRYPTOLOGY — CRYPTO 2002
  • 2012-02-05. The parazoa family: generalizing the sponge hash functions in INTERNATIONAL JOURNAL OF INFORMATION SECURITY
  • 2006. Formalizing Human Ignorance in PROGRESS IN CRYPTOLOGY - VIETCRYPT 2006
  • 2004. Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology in THEORY OF CRYPTOGRAPHY
  • 2008. On the Indifferentiability of the Sponge Construction in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 2008-01-01. Security/Efficiency Tradeoffs for Permutation-Based Hashing in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 1994. Hash functions based on block ciphers: a synthetic approach in ADVANCES IN CRYPTOLOGY — CRYPTO’ 93
  • 2005. A Failure-Friendly Design Principle for Hash Functions in ADVANCES IN CRYPTOLOGY - ASIACRYPT 2005
  • 1990. A Design Principle for Hash Functions in ADVANCES IN CRYPTOLOGY — CRYPTO’ 89 PROCEEDINGS
  • 2008-04-16. A synthetic indifferentiability analysis of some block-cipher-based hash functions in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2005. Merkle-Damgård Revisited: How to Construct a Hash Function in ADVANCES IN CRYPTOLOGY – CRYPTO 2005
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s10207-012-0156-7

    DOI

    http://dx.doi.org/10.1007/s10207-012-0156-7

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1043630722


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.5596.f", 
              "name": [
                "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Andreeva", 
            "givenName": "Elena", 
            "id": "sg:person.010624232445.91", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010624232445.91"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.5596.f", 
              "name": [
                "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Bogdanov", 
            "givenName": "Andrey", 
            "id": "sg:person.015653275215.96", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015653275215.96"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.5596.f", 
              "name": [
                "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Mennink", 
            "givenName": "Bart", 
            "id": "sg:person.012130641461.76", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.5596.f", 
              "name": [
                "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Preneel", 
            "givenName": "Bart", 
            "id": "sg:person.011115044357.39", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Institut for Matematik, Danmarks Tekniske Universitet, Copenhagen, Denmark", 
              "id": "http://www.grid.ac/institutes/grid.5170.3", 
              "name": [
                "Institut for Matematik, Danmarks Tekniske Universitet, Copenhagen, Denmark"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Rechberger", 
            "givenName": "Christian", 
            "id": "sg:person.013632630546.55", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013632630546.55"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-642-18178-8_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047663745", 
              "https://doi.org/10.1007/978-3-642-18178-8_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-13858-4_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042043203", 
              "https://doi.org/10.1007/978-3-642-13858-4_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11426639_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043264875", 
              "https://doi.org/10.1007/11426639_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-25937-4_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044984781", 
              "https://doi.org/10.1007/978-3-540-25937-4_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11426639_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047991750", 
              "https://doi.org/10.1007/11426639_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45708-9_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019344851", 
              "https://doi.org/10.1007/3-540-45708-9_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03317-9_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021850873", 
              "https://doi.org/10.1007/978-3-642-03317-9_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-01001-9_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025501808", 
              "https://doi.org/10.1007/978-3-642-01001-9_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11535218_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1015438097", 
              "https://doi.org/10.1007/11535218_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-68914-0_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020020897", 
              "https://doi.org/10.1007/978-3-540-68914-0_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-47555-9_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001052854", 
              "https://doi.org/10.1007/3-540-47555-9_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-22497-3_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029342066", 
              "https://doi.org/10.1007/978-3-642-22497-3_30"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24638-1_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050815296", 
              "https://doi.org/10.1007/978-3-540-24638-1_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48329-2_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050504124", 
              "https://doi.org/10.1007/3-540-48329-2_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-38424-3_1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051497750", 
              "https://doi.org/10.1007/3-540-38424-3_1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10207-012-0157-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047161147", 
              "https://doi.org/10.1007/s10207-012-0157-6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-85174-5_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018237593", 
              "https://doi.org/10.1007/978-3-540-85174-5_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11535218_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002819603", 
              "https://doi.org/10.1007/11535218_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11426639_28", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048303586", 
              "https://doi.org/10.1007/11426639_28"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-78967-3_13", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042749994", 
              "https://doi.org/10.1007/978-3-540-78967-3_13"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-13190-5_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002239591", 
              "https://doi.org/10.1007/978-3-642-13190-5_30"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11935230_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014312861", 
              "https://doi.org/10.1007/11935230_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-04722-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052093804", 
              "https://doi.org/10.1007/978-3-662-04722-4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-19574-7_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012595340", 
              "https://doi.org/10.1007/978-3-642-19574-7_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10623-008-9208-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011916487", 
              "https://doi.org/10.1007/s10623-008-9208-4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-387-34805-0_39", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026402674", 
              "https://doi.org/10.1007/0-387-34805-0_39"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-04159-4_9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017917454", 
              "https://doi.org/10.1007/978-3-642-04159-4_9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-15317-4_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009210542", 
              "https://doi.org/10.1007/978-3-642-15317-4_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-76900-2_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049072174", 
              "https://doi.org/10.1007/978-3-540-76900-2_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-35999-6_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045705277", 
              "https://doi.org/10.1007/978-3-642-35999-6_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-10628-6_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011355057", 
              "https://doi.org/10.1007/978-3-642-10628-6_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45325-3_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027862600", 
              "https://doi.org/10.1007/3-540-45325-3_20"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-78967-3_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048096154", 
              "https://doi.org/10.1007/978-3-540-78967-3_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11593447_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016224392", 
              "https://doi.org/10.1007/11593447_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-19574-7_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014082065", 
              "https://doi.org/10.1007/978-3-642-19574-7_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11958239_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046670887", 
              "https://doi.org/10.1007/11958239_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00607-009-0034-y", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046599863", 
              "https://doi.org/10.1007/s00607-009-0034-y"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-31410-0_18", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047339054", 
              "https://doi.org/10.1007/978-3-642-31410-0_18"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-387-34805-0_40", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008729969", 
              "https://doi.org/10.1007/0-387-34805-0_40"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-68697-5_1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024453790", 
              "https://doi.org/10.1007/3-540-68697-5_1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-02620-1_12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020017022", 
              "https://doi.org/10.1007/978-3-642-02620-1_12"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11818175_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026444270", 
              "https://doi.org/10.1007/11818175_3"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2012-02-11", 
        "datePublishedReg": "2012-02-11", 
        "description": "In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities like differential attacks identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. 14 candidates were left in the second round, out of which five candidates have been recently chosen for the final round. An important criterion in the selection process is the SHA-3 hash function security. We identify two important classes of security arguments for the new designs: (1) the possible reductions of the hash function security to the security of its underlying building blocks and (2) arguments against differential attack on building blocks. In this paper, we compare the state of the art provable security reductions for the second round candidates and review arguments and bounds against classes of differential attacks. We discuss all the SHA-3 candidates at a high functional level, analyze, and summarize the security reduction results and bounds against differential attacks. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s10207-012-0156-7", 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1136826", 
            "issn": [
              "1615-5262", 
              "1615-5270"
            ], 
            "name": "International Journal of Information Security", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "2", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "11"
          }
        ], 
        "keywords": [
          "higher functional level", 
          "US National Institutes", 
          "National Institute", 
          "functional level", 
          "first round", 
          "second round", 
          "final round", 
          "hash function security", 
          "candidates", 
          "possible reduction", 
          "SHA-3 candidates", 
          "differential attacks", 
          "reduction", 
          "rounds", 
          "response", 
          "security arguments", 
          "cryptographic hash algorithm", 
          "new cryptographic hash algorithm", 
          "criteria", 
          "levels", 
          "Institute", 
          "second round SHA-3 candidates", 
          "hash algorithm", 
          "attacks", 
          "hash function", 
          "preservation", 
          "SHA-1", 
          "security reduction", 
          "function", 
          "second round candidates", 
          "security", 
          "block", 
          "standards", 
          "vulnerability", 
          "important criteria", 
          "selection process", 
          "building blocks", 
          "review arguments", 
          "results", 
          "padding", 
          "calls", 
          "submission", 
          "MD5", 
          "class", 
          "reduction results", 
          "design", 
          "algorithm", 
          "important class", 
          "new design", 
          "bounds", 
          "technology", 
          "NIST", 
          "state", 
          "process", 
          "proof", 
          "argument", 
          "paper"
        ], 
        "name": "On security arguments of the second round SHA-3 candidates", 
        "pagination": "103-120", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1043630722"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s10207-012-0156-7"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s10207-012-0156-7", 
          "https://app.dimensions.ai/details/publication/pub.1043630722"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-10-01T06:38", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20221001/entities/gbq_results/article/article_577.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s10207-012-0156-7"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10207-012-0156-7'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10207-012-0156-7'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10207-012-0156-7'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10207-012-0156-7'


     

    This table displays all metadata directly associated to this object as RDF triples.

    313 TRIPLES      21 PREDICATES      123 URIs      73 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s10207-012-0156-7 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author N51d155c8641c451984dead9d3456f868
    4 schema:citation sg:pub.10.1007/0-387-34805-0_39
    5 sg:pub.10.1007/0-387-34805-0_40
    6 sg:pub.10.1007/11426639_2
    7 sg:pub.10.1007/11426639_28
    8 sg:pub.10.1007/11426639_31
    9 sg:pub.10.1007/11535218_2
    10 sg:pub.10.1007/11535218_26
    11 sg:pub.10.1007/11593447_26
    12 sg:pub.10.1007/11818175_3
    13 sg:pub.10.1007/11935230_19
    14 sg:pub.10.1007/11958239_14
    15 sg:pub.10.1007/3-540-38424-3_1
    16 sg:pub.10.1007/3-540-45325-3_20
    17 sg:pub.10.1007/3-540-45708-9_21
    18 sg:pub.10.1007/3-540-47555-9_5
    19 sg:pub.10.1007/3-540-48329-2_31
    20 sg:pub.10.1007/3-540-68697-5_1
    21 sg:pub.10.1007/978-3-540-24638-1_2
    22 sg:pub.10.1007/978-3-540-25937-4_24
    23 sg:pub.10.1007/978-3-540-68914-0_10
    24 sg:pub.10.1007/978-3-540-76900-2_8
    25 sg:pub.10.1007/978-3-540-78967-3_11
    26 sg:pub.10.1007/978-3-540-78967-3_13
    27 sg:pub.10.1007/978-3-540-85174-5_22
    28 sg:pub.10.1007/978-3-642-01001-9_22
    29 sg:pub.10.1007/978-3-642-02620-1_12
    30 sg:pub.10.1007/978-3-642-03317-9_5
    31 sg:pub.10.1007/978-3-642-04159-4_9
    32 sg:pub.10.1007/978-3-642-10628-6_14
    33 sg:pub.10.1007/978-3-642-13190-5_30
    34 sg:pub.10.1007/978-3-642-13858-4_10
    35 sg:pub.10.1007/978-3-642-15317-4_7
    36 sg:pub.10.1007/978-3-642-18178-8_5
    37 sg:pub.10.1007/978-3-642-19574-7_24
    38 sg:pub.10.1007/978-3-642-19574-7_26
    39 sg:pub.10.1007/978-3-642-22497-3_30
    40 sg:pub.10.1007/978-3-642-31410-0_18
    41 sg:pub.10.1007/978-3-642-35999-6_21
    42 sg:pub.10.1007/978-3-662-04722-4
    43 sg:pub.10.1007/s00607-009-0034-y
    44 sg:pub.10.1007/s10207-012-0157-6
    45 sg:pub.10.1007/s10623-008-9208-4
    46 schema:datePublished 2012-02-11
    47 schema:datePublishedReg 2012-02-11
    48 schema:description In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities like differential attacks identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. 14 candidates were left in the second round, out of which five candidates have been recently chosen for the final round. An important criterion in the selection process is the SHA-3 hash function security. We identify two important classes of security arguments for the new designs: (1) the possible reductions of the hash function security to the security of its underlying building blocks and (2) arguments against differential attack on building blocks. In this paper, we compare the state of the art provable security reductions for the second round candidates and review arguments and bounds against classes of differential attacks. We discuss all the SHA-3 candidates at a high functional level, analyze, and summarize the security reduction results and bounds against differential attacks. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered.
    49 schema:genre article
    50 schema:isAccessibleForFree true
    51 schema:isPartOf N1738a37e4df44d2096b3c3516b80a91e
    52 Nf070a19d6866471fbced05a1952dd357
    53 sg:journal.1136826
    54 schema:keywords Institute
    55 MD5
    56 NIST
    57 National Institute
    58 SHA-1
    59 SHA-3 candidates
    60 US National Institutes
    61 algorithm
    62 argument
    63 attacks
    64 block
    65 bounds
    66 building blocks
    67 calls
    68 candidates
    69 class
    70 criteria
    71 cryptographic hash algorithm
    72 design
    73 differential attacks
    74 final round
    75 first round
    76 function
    77 functional level
    78 hash algorithm
    79 hash function
    80 hash function security
    81 higher functional level
    82 important class
    83 important criteria
    84 levels
    85 new cryptographic hash algorithm
    86 new design
    87 padding
    88 paper
    89 possible reduction
    90 preservation
    91 process
    92 proof
    93 reduction
    94 reduction results
    95 response
    96 results
    97 review arguments
    98 rounds
    99 second round
    100 second round SHA-3 candidates
    101 second round candidates
    102 security
    103 security arguments
    104 security reduction
    105 selection process
    106 standards
    107 state
    108 submission
    109 technology
    110 vulnerability
    111 schema:name On security arguments of the second round SHA-3 candidates
    112 schema:pagination 103-120
    113 schema:productId N12d359d5baf342779cc4c3b796c4e355
    114 Ndf3c9e5d72a744b5800dc2917afa78c9
    115 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043630722
    116 https://doi.org/10.1007/s10207-012-0156-7
    117 schema:sdDatePublished 2022-10-01T06:38
    118 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    119 schema:sdPublisher Nb6ff492d9be44a07b8ea2448fa6d2a1f
    120 schema:url https://doi.org/10.1007/s10207-012-0156-7
    121 sgo:license sg:explorer/license/
    122 sgo:sdDataset articles
    123 rdf:type schema:ScholarlyArticle
    124 N1039be2c7f1b43d5b26a9d49e645d915 rdf:first sg:person.015653275215.96
    125 rdf:rest N7e8265d8b1a944d0be26b791f15aa3fd
    126 N12d359d5baf342779cc4c3b796c4e355 schema:name dimensions_id
    127 schema:value pub.1043630722
    128 rdf:type schema:PropertyValue
    129 N1738a37e4df44d2096b3c3516b80a91e schema:volumeNumber 11
    130 rdf:type schema:PublicationVolume
    131 N51d155c8641c451984dead9d3456f868 rdf:first sg:person.010624232445.91
    132 rdf:rest N1039be2c7f1b43d5b26a9d49e645d915
    133 N7e8265d8b1a944d0be26b791f15aa3fd rdf:first sg:person.012130641461.76
    134 rdf:rest Nf13200cc49ca45f696abf3bceb7afba9
    135 Nb6ff492d9be44a07b8ea2448fa6d2a1f schema:name Springer Nature - SN SciGraph project
    136 rdf:type schema:Organization
    137 Ndf3c9e5d72a744b5800dc2917afa78c9 schema:name doi
    138 schema:value 10.1007/s10207-012-0156-7
    139 rdf:type schema:PropertyValue
    140 Ne1138e9b33244bbea36a6602d3d5f773 rdf:first sg:person.013632630546.55
    141 rdf:rest rdf:nil
    142 Nf070a19d6866471fbced05a1952dd357 schema:issueNumber 2
    143 rdf:type schema:PublicationIssue
    144 Nf13200cc49ca45f696abf3bceb7afba9 rdf:first sg:person.011115044357.39
    145 rdf:rest Ne1138e9b33244bbea36a6602d3d5f773
    146 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    147 schema:name Information and Computing Sciences
    148 rdf:type schema:DefinedTerm
    149 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    150 schema:name Data Format
    151 rdf:type schema:DefinedTerm
    152 sg:journal.1136826 schema:issn 1615-5262
    153 1615-5270
    154 schema:name International Journal of Information Security
    155 schema:publisher Springer Nature
    156 rdf:type schema:Periodical
    157 sg:person.010624232445.91 schema:affiliation grid-institutes:grid.5596.f
    158 schema:familyName Andreeva
    159 schema:givenName Elena
    160 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010624232445.91
    161 rdf:type schema:Person
    162 sg:person.011115044357.39 schema:affiliation grid-institutes:grid.5596.f
    163 schema:familyName Preneel
    164 schema:givenName Bart
    165 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39
    166 rdf:type schema:Person
    167 sg:person.012130641461.76 schema:affiliation grid-institutes:grid.5596.f
    168 schema:familyName Mennink
    169 schema:givenName Bart
    170 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76
    171 rdf:type schema:Person
    172 sg:person.013632630546.55 schema:affiliation grid-institutes:grid.5170.3
    173 schema:familyName Rechberger
    174 schema:givenName Christian
    175 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013632630546.55
    176 rdf:type schema:Person
    177 sg:person.015653275215.96 schema:affiliation grid-institutes:grid.5596.f
    178 schema:familyName Bogdanov
    179 schema:givenName Andrey
    180 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015653275215.96
    181 rdf:type schema:Person
    182 sg:pub.10.1007/0-387-34805-0_39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026402674
    183 https://doi.org/10.1007/0-387-34805-0_39
    184 rdf:type schema:CreativeWork
    185 sg:pub.10.1007/0-387-34805-0_40 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008729969
    186 https://doi.org/10.1007/0-387-34805-0_40
    187 rdf:type schema:CreativeWork
    188 sg:pub.10.1007/11426639_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043264875
    189 https://doi.org/10.1007/11426639_2
    190 rdf:type schema:CreativeWork
    191 sg:pub.10.1007/11426639_28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048303586
    192 https://doi.org/10.1007/11426639_28
    193 rdf:type schema:CreativeWork
    194 sg:pub.10.1007/11426639_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047991750
    195 https://doi.org/10.1007/11426639_31
    196 rdf:type schema:CreativeWork
    197 sg:pub.10.1007/11535218_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002819603
    198 https://doi.org/10.1007/11535218_2
    199 rdf:type schema:CreativeWork
    200 sg:pub.10.1007/11535218_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015438097
    201 https://doi.org/10.1007/11535218_26
    202 rdf:type schema:CreativeWork
    203 sg:pub.10.1007/11593447_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016224392
    204 https://doi.org/10.1007/11593447_26
    205 rdf:type schema:CreativeWork
    206 sg:pub.10.1007/11818175_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026444270
    207 https://doi.org/10.1007/11818175_3
    208 rdf:type schema:CreativeWork
    209 sg:pub.10.1007/11935230_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014312861
    210 https://doi.org/10.1007/11935230_19
    211 rdf:type schema:CreativeWork
    212 sg:pub.10.1007/11958239_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046670887
    213 https://doi.org/10.1007/11958239_14
    214 rdf:type schema:CreativeWork
    215 sg:pub.10.1007/3-540-38424-3_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051497750
    216 https://doi.org/10.1007/3-540-38424-3_1
    217 rdf:type schema:CreativeWork
    218 sg:pub.10.1007/3-540-45325-3_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027862600
    219 https://doi.org/10.1007/3-540-45325-3_20
    220 rdf:type schema:CreativeWork
    221 sg:pub.10.1007/3-540-45708-9_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019344851
    222 https://doi.org/10.1007/3-540-45708-9_21
    223 rdf:type schema:CreativeWork
    224 sg:pub.10.1007/3-540-47555-9_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001052854
    225 https://doi.org/10.1007/3-540-47555-9_5
    226 rdf:type schema:CreativeWork
    227 sg:pub.10.1007/3-540-48329-2_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050504124
    228 https://doi.org/10.1007/3-540-48329-2_31
    229 rdf:type schema:CreativeWork
    230 sg:pub.10.1007/3-540-68697-5_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024453790
    231 https://doi.org/10.1007/3-540-68697-5_1
    232 rdf:type schema:CreativeWork
    233 sg:pub.10.1007/978-3-540-24638-1_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050815296
    234 https://doi.org/10.1007/978-3-540-24638-1_2
    235 rdf:type schema:CreativeWork
    236 sg:pub.10.1007/978-3-540-25937-4_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044984781
    237 https://doi.org/10.1007/978-3-540-25937-4_24
    238 rdf:type schema:CreativeWork
    239 sg:pub.10.1007/978-3-540-68914-0_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020020897
    240 https://doi.org/10.1007/978-3-540-68914-0_10
    241 rdf:type schema:CreativeWork
    242 sg:pub.10.1007/978-3-540-76900-2_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049072174
    243 https://doi.org/10.1007/978-3-540-76900-2_8
    244 rdf:type schema:CreativeWork
    245 sg:pub.10.1007/978-3-540-78967-3_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048096154
    246 https://doi.org/10.1007/978-3-540-78967-3_11
    247 rdf:type schema:CreativeWork
    248 sg:pub.10.1007/978-3-540-78967-3_13 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042749994
    249 https://doi.org/10.1007/978-3-540-78967-3_13
    250 rdf:type schema:CreativeWork
    251 sg:pub.10.1007/978-3-540-85174-5_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018237593
    252 https://doi.org/10.1007/978-3-540-85174-5_22
    253 rdf:type schema:CreativeWork
    254 sg:pub.10.1007/978-3-642-01001-9_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025501808
    255 https://doi.org/10.1007/978-3-642-01001-9_22
    256 rdf:type schema:CreativeWork
    257 sg:pub.10.1007/978-3-642-02620-1_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020017022
    258 https://doi.org/10.1007/978-3-642-02620-1_12
    259 rdf:type schema:CreativeWork
    260 sg:pub.10.1007/978-3-642-03317-9_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021850873
    261 https://doi.org/10.1007/978-3-642-03317-9_5
    262 rdf:type schema:CreativeWork
    263 sg:pub.10.1007/978-3-642-04159-4_9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017917454
    264 https://doi.org/10.1007/978-3-642-04159-4_9
    265 rdf:type schema:CreativeWork
    266 sg:pub.10.1007/978-3-642-10628-6_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011355057
    267 https://doi.org/10.1007/978-3-642-10628-6_14
    268 rdf:type schema:CreativeWork
    269 sg:pub.10.1007/978-3-642-13190-5_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002239591
    270 https://doi.org/10.1007/978-3-642-13190-5_30
    271 rdf:type schema:CreativeWork
    272 sg:pub.10.1007/978-3-642-13858-4_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042043203
    273 https://doi.org/10.1007/978-3-642-13858-4_10
    274 rdf:type schema:CreativeWork
    275 sg:pub.10.1007/978-3-642-15317-4_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009210542
    276 https://doi.org/10.1007/978-3-642-15317-4_7
    277 rdf:type schema:CreativeWork
    278 sg:pub.10.1007/978-3-642-18178-8_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047663745
    279 https://doi.org/10.1007/978-3-642-18178-8_5
    280 rdf:type schema:CreativeWork
    281 sg:pub.10.1007/978-3-642-19574-7_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012595340
    282 https://doi.org/10.1007/978-3-642-19574-7_24
    283 rdf:type schema:CreativeWork
    284 sg:pub.10.1007/978-3-642-19574-7_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014082065
    285 https://doi.org/10.1007/978-3-642-19574-7_26
    286 rdf:type schema:CreativeWork
    287 sg:pub.10.1007/978-3-642-22497-3_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029342066
    288 https://doi.org/10.1007/978-3-642-22497-3_30
    289 rdf:type schema:CreativeWork
    290 sg:pub.10.1007/978-3-642-31410-0_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047339054
    291 https://doi.org/10.1007/978-3-642-31410-0_18
    292 rdf:type schema:CreativeWork
    293 sg:pub.10.1007/978-3-642-35999-6_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045705277
    294 https://doi.org/10.1007/978-3-642-35999-6_21
    295 rdf:type schema:CreativeWork
    296 sg:pub.10.1007/978-3-662-04722-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052093804
    297 https://doi.org/10.1007/978-3-662-04722-4
    298 rdf:type schema:CreativeWork
    299 sg:pub.10.1007/s00607-009-0034-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1046599863
    300 https://doi.org/10.1007/s00607-009-0034-y
    301 rdf:type schema:CreativeWork
    302 sg:pub.10.1007/s10207-012-0157-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047161147
    303 https://doi.org/10.1007/s10207-012-0157-6
    304 rdf:type schema:CreativeWork
    305 sg:pub.10.1007/s10623-008-9208-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011916487
    306 https://doi.org/10.1007/s10623-008-9208-4
    307 rdf:type schema:CreativeWork
    308 grid-institutes:grid.5170.3 schema:alternateName Institut for Matematik, Danmarks Tekniske Universitet, Copenhagen, Denmark
    309 schema:name Institut for Matematik, Danmarks Tekniske Universitet, Copenhagen, Denmark
    310 rdf:type schema:Organization
    311 grid-institutes:grid.5596.f schema:alternateName Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium
    312 schema:name Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium
    313 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...