Advances in Cryptology – EUROCRYPT 2012 [[electronic resource] ] : 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012, Proceedings / / edited by David Pointcheval, Thomas Johansson |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XIV, 758 p.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Computer communication systems Computer security Algorithms Computer science—Mathematics Management information systems Computer science Cryptology Computer Communication Networks Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems |
ISBN | 3-642-29011-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465990403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology – EUROCRYPT 2013 [[electronic resource] ] : 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013, Proceedings / / edited by Thomas Johansson, Phong Q. Nguyen |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XIV, 736 p. 77 illus.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Algorithms Computer security Computer science—Mathematics Cryptology Algorithm Analysis and Problem Complexity Systems and Data Security Discrete Mathematics in Computer Science |
ISBN | 3-642-38348-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Candidate Multilinear Maps from Ideal Lattices -- Lossy Codes and a New Variant of the Learning-With-Errors Problem -- A Toolkit for Ring-LWE Cryptography -- Regularity of Lossy RSA on Subdomains and Its Applications -- Efficient Cryptosystems from 2k-th Power Residue Symbols -- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions -- How to Watermark Cryptographic Functions -- Security Evaluations beyond Computing Power: How to Analyze Side-Channel Attacks You Cannot Mount? -- Masking against Side-Channel Attacks: A Formal Security Proof -- Leakage-Resilient Cryptography from Minimal Assumptions -- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields -- Fast Cryptography in Genus 2 -- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem -- Cryptanalysis of Full RIPEMD-128 -- New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis -- Improving Local Collisions: New Attacks on Reduced SHA-256 -- Dynamic Proofs of Retrievability via Oblivious RAM -- Message-Locked Encryption and Secure Deduplication -- Batch Fully Homomorphic Encryption over the Integers -- Practical Homomorphic MACs for Arithmetic Circuits -- Streaming Authenticated Data Structures -- Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting -- New Links between Differential and Linear Cryptanalysis -- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption -- Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions -- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures -- Practical Signatures from Standard Assumptions -- Locally Computable UOWHF with Linear Shrinkage -- Amplification of Chosen-Ciphertext Security -- Circular Chosen-Ciphertext Security with Compact Ciphertexts -- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions -- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation -- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction -- Quantum-Secure Message Authentication Codes -- One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games -- Quadratic Span Programs and Succinct NIZKs without PCPs -- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists -- Resource-Restricted Indifferentiability -- On Concurrently Secure Computation in the Multiple Ideal Query Model -- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions -- How to Garble RAM Programs?. |
Record Nr. | UNISA-996466569303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology – EUROCRYPT 2013 : 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013, Proceedings / / edited by Thomas Johansson, Phong Q. Nguyen |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XIV, 736 p. 77 illus.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Algorithms Computer security Computer science—Mathematics Cryptology Algorithm Analysis and Problem Complexity Systems and Data Security Discrete Mathematics in Computer Science |
ISBN | 3-642-38348-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Candidate Multilinear Maps from Ideal Lattices -- Lossy Codes and a New Variant of the Learning-With-Errors Problem -- A Toolkit for Ring-LWE Cryptography -- Regularity of Lossy RSA on Subdomains and Its Applications -- Efficient Cryptosystems from 2k-th Power Residue Symbols -- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions -- How to Watermark Cryptographic Functions -- Security Evaluations beyond Computing Power: How to Analyze Side-Channel Attacks You Cannot Mount? -- Masking against Side-Channel Attacks: A Formal Security Proof -- Leakage-Resilient Cryptography from Minimal Assumptions -- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields -- Fast Cryptography in Genus 2 -- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem -- Cryptanalysis of Full RIPEMD-128 -- New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis -- Improving Local Collisions: New Attacks on Reduced SHA-256 -- Dynamic Proofs of Retrievability via Oblivious RAM -- Message-Locked Encryption and Secure Deduplication -- Batch Fully Homomorphic Encryption over the Integers -- Practical Homomorphic MACs for Arithmetic Circuits -- Streaming Authenticated Data Structures -- Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting -- New Links between Differential and Linear Cryptanalysis -- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption -- Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions -- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures -- Practical Signatures from Standard Assumptions -- Locally Computable UOWHF with Linear Shrinkage -- Amplification of Chosen-Ciphertext Security -- Circular Chosen-Ciphertext Security with Compact Ciphertexts -- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions -- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation -- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction -- Quantum-Secure Message Authentication Codes -- One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games -- Quadratic Span Programs and Succinct NIZKs without PCPs -- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists -- Resource-Restricted Indifferentiability -- On Concurrently Secure Computation in the Multiple Ideal Query Model -- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions -- How to Garble RAM Programs?. |
Record Nr. | UNINA-9910483525503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Among Men : Moulding Masculinities, Volume 1 / / by Søren Ervø and Thomas Johansson |
Autore | Ervø Søren |
Edizione | [First edition.] |
Pubbl/distr/stampa | Boca Raton, FL : , : Routledge, , [2016] |
Descrizione fisica | 1 online resource (344 pages) |
Disciplina | 305.31 |
Soggetto topico |
Masculinity
Men Body image in men Masculinity - Scandinavia Men - Scandinavia |
ISBN |
1-315-26283-5
1-351-95923-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Contents: Foreword, Michael Kimmel; Introduction, Sren Erv and Thomas Johansson; Men, gender and the state, R.W. Connell; A theory of gender, patriarchy and capitalism, ystein Gullvg Holter; The emancipation from gender: a critique of the Utopias of postmodern gender theory, Mikael Carleheden; Beautiful men, fine women and good work people: gender and skill in Northern Sweden 1850-1950, Ella Johansson; Masculine sport and masculinity in Denmark at the turn of the century, Hans Bonde; Masculinity and the north, Lena Eskilsson; Modern masculinities? Continuities, challenges and changes in mens lives, Michael Meuser; Technology and masculinity: men and their machines, Ulf Mellstrm; Contingency and desire: the ritual construction of masculinity in a right-wing political youth organization, Philip Lalander; A death mask of masculinity: the brotherhood of Norwegian right-wing skinheads, Katrine Fangen; Fathering, masculinity and parental relationships, Victor Jeleniewski Seidler; Mens lack of family orientation: some reflections on Scandinavian research on families, Christian Kullberg; Fatherhood and masculinity: non-resident fathers construction of identity, Thomas Johansson; Masculinity and paranoia in Strindbergs 'The Father', Jrgen Lorentzen; Phallic lovers, non-phallic lovers: stereotyped masculinities in womens novels of the 1970s, Helena Wahlstrm; Fathers - the solution or part of the problem? Single mothers, their sons and social work, Thomas Johansson; Index. |
Record Nr. | UNINA-9910154975403321 |
Ervø Søren | ||
Boca Raton, FL : , : Routledge, , [2016] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Fast Software Encryption [[electronic resource] ] : 10th International Workshop, FSE 2003, LUND, Sweden, February 24-26, 2003, Revised Papers / / edited by Thomas Johansson |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (X, 402 p.) |
Disciplina | 005.82 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Coding theory Information theory Algorithms Computer science—Mathematics Computer software Cryptology Coding and Information Theory Algorithm Analysis and Problem Complexity Symbolic and Algebraic Manipulation Mathematical Software |
ISBN | 3-540-39887-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Block Cipher Cryptanalysis -- Cryptanalysis of IDEA-X/2 -- Differential-Linear Cryptanalysis of Serpent -- Rectangle Attacks on 49-Round SHACAL-1 -- Cryptanalysis of Block Ciphers Based on SHA-1 and MD5 -- Analysis of Involutional Ciphers: Khazad and Anubis -- Boolean Functions and S-Boxes -- On Plateaued Functions and Their Constructions -- Linear Redundancy in S-Boxes -- Stream Cipher Cryptanalysis -- Loosening the KNOT -- On the Resynchronization Attack -- Cryptanalysis of Sober-t32 -- MACs -- OMAC: One-Key CBC MAC -- A Concrete Security Analysis for 3GPP-MAC -- New Attacks against Standardized MACs -- Analysis of RMAC -- Side Channel Attacks -- A Generic Protection against High-Order Differential Power Analysis -- A New Class of Collision Attacks and Its Application to DES -- Block Cipher Theory -- Further Observations on the Structure of the AES Algorithm -- Optimal Key Ranking Procedures in a Statistical Cryptanalysis -- Improving the Upper Bound on the Maximum Differential and the Maximum Linear Hull Probability for SPN Structures and AES -- Linear Approximations of Addition Modulo 2 n -- Block Ciphers and Systems of Quadratic Equations -- New Designs -- Turing: A Fast Stream Cipher -- Rabbit: A New High-Performance Stream Cipher -- Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive -- PARSHA-256 – A New Parallelizable Hash Function and a Multithreaded Implementation -- Modes of Operation -- Practical Symmetric On-Line Encryption -- The Security of ”One-Block-to-Many” Modes of Operation. |
Record Nr. | UNISA-996465788403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Fast Software Encryption : 10th International Workshop, FSE 2003, LUND, Sweden, February 24-26, 2003, Revised Papers / / edited by Thomas Johansson |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (X, 402 p.) |
Disciplina | 005.82 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Coding theory Information theory Algorithms Computer science—Mathematics Computer software Cryptology Coding and Information Theory Algorithm Analysis and Problem Complexity Symbolic and Algebraic Manipulation Mathematical Software |
ISBN | 3-540-39887-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Block Cipher Cryptanalysis -- Cryptanalysis of IDEA-X/2 -- Differential-Linear Cryptanalysis of Serpent -- Rectangle Attacks on 49-Round SHACAL-1 -- Cryptanalysis of Block Ciphers Based on SHA-1 and MD5 -- Analysis of Involutional Ciphers: Khazad and Anubis -- Boolean Functions and S-Boxes -- On Plateaued Functions and Their Constructions -- Linear Redundancy in S-Boxes -- Stream Cipher Cryptanalysis -- Loosening the KNOT -- On the Resynchronization Attack -- Cryptanalysis of Sober-t32 -- MACs -- OMAC: One-Key CBC MAC -- A Concrete Security Analysis for 3GPP-MAC -- New Attacks against Standardized MACs -- Analysis of RMAC -- Side Channel Attacks -- A Generic Protection against High-Order Differential Power Analysis -- A New Class of Collision Attacks and Its Application to DES -- Block Cipher Theory -- Further Observations on the Structure of the AES Algorithm -- Optimal Key Ranking Procedures in a Statistical Cryptanalysis -- Improving the Upper Bound on the Maximum Differential and the Maximum Linear Hull Probability for SPN Structures and AES -- Linear Approximations of Addition Modulo 2 n -- Block Ciphers and Systems of Quadratic Equations -- New Designs -- Turing: A Fast Stream Cipher -- Rabbit: A New High-Performance Stream Cipher -- Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive -- PARSHA-256 – A New Parallelizable Hash Function and a Multithreaded Implementation -- Modes of Operation -- Practical Symmetric On-Line Encryption -- The Security of ”One-Block-to-Many” Modes of Operation. |
Record Nr. | UNINA-9910768438403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Fitness doping : trajectories, gender, bodies and health / / Jesper Andreasson, Thomas Johansson |
Autore | Andreasson Jesper |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Palgrave Macmillan, , [2020] |
Descrizione fisica | 1 online resource (x, 217 pages) |
Disciplina | 306.48 |
Collana | Gale eBooks |
Soggetto topico |
Human body - Social aspects
Physical fitness - Social aspects Gender identity in sports Athletes - Drug use |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Part I: Contextualising Fitness Doping -- Chapter 1: Introduction -- Chapter 2: Doping – Historical and Contemporary Perspectives -- Chapter 3. Glocal Fitness Doping -- Part II: Doping Trajectories -- Chapter 4: Images of (Ab)users -- Chapter 5: (Un)becoming a Doper User -- Chapter 6. Fitness Doping Online -- Part III: Doped Bodies and Gender -- Chapter 7: Re-conceptualizing Doping and Masculinity -- Chapter 8. Female Fitness Doping -- Part IV: Conclusions -- Chapter 9. Trajectories and the New Doping Demography -- Chapter 10. Research Design and Methodological Considerations. |
Record Nr. | UNINA-9910370059103321 |
Andreasson Jesper | ||
Cham : , : Palgrave Macmillan, , [2020] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
NORCHIP, Linköping, Sweden, 20-21 November 2006 : proceedings |
Pubbl/distr/stampa | [Place of publication not identified], : IEEE, 2006 |
Disciplina | 621.3815 |
Soggetto topico |
Application-specific integrated circuits
Microelectronics Electrical & Computer Engineering Engineering & Applied Sciences Electrical Engineering |
ISBN | 1-5090-9574-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996201764403316 |
[Place of publication not identified], : IEEE, 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
NORCHIP, Linköping, Sweden, 20-21 November 2006 : proceedings |
Pubbl/distr/stampa | [Place of publication not identified], : IEEE, 2006 |
Disciplina | 621.3815 |
Soggetto topico |
Application-specific integrated circuits
Microelectronics Electrical & Computer Engineering Engineering & Applied Sciences Electrical Engineering |
ISBN | 1-5090-9574-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910143015303321 |
[Place of publication not identified], : IEEE, 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Post-quantum cryptography : 13th international workshop, PQCrypto 2022, virtual event, September 28-30, 2022, proceedings / / Jung Hee Cheon and Thomas Johansson, editors |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer International Publishing, , [2022] |
Descrizione fisica | 1 online resource (523 pages) |
Disciplina | 005.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Quantum computers |
ISBN | 3-031-17234-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Code-Based Cryptography -- Hybrid Decoding - Classical-Quantum Trade-Offs for Information Set Decoding -- 1 Introduction -- 2 Preliminaries -- 3 A Quantum ISD Circuit Design -- 3.1 Reducing the Width for Free -- 4 Classical-Time Quantum-Memory Trade-Offs -- 4.1 Shortening the Code -- 4.2 Puncturing the Code -- 4.3 Combined Hybrid -- References -- How to Backdoor (Classic) McEliece and How to Guard Against Backdoors -- 1 Introduction -- 2 Background -- 2.1 McEliece and Binary Goppa Codes -- 2.2 SETUP Mechanism -- 3 Backdooring Vanilla McEliece -- 3.1 Key Generation for Vanilla McEliece -- 3.2 Vanilla McEliece Strong SETUP -- 3.3 From Strong to Weak SETUP -- 4 How to Backdoor Classic McEliece -- 5 How to Use McEliece Encryption Against Classic McEliece -- A Appendix: A Simpler (But Flawed) SETUP Mechanism -- A.1 A Flawed SETUP -- A.2 The distinguisher -- References -- LRPC Codes with Multiple Syndromes: Near Ideal-Size KEMs Without Ideals -- 1 Introduction and Previous Work -- 2 Background on Rank Metric Codes -- 2.1 General Definitions -- 2.2 Ideal Codes -- 2.3 Difficult Problems in Rank Metric -- 3 LRPC Codes and their Decoding -- 3.1 Low Rank Parity Check Codes -- 3.2 A Basic Decoding Algorithm -- 3.3 LRPC Codes Indistinguishability -- 4 LRPC with Multiple Syndromes -- 4.1 General Idea -- 4.2 Description of the Scheme (LRPC-MS) -- 4.3 Description of the Scheme with Ideal Structure (ILRPC-MS) -- 4.4 Decoding Failure Rate of Our Scheme -- 4.5 Impact on the Asymptotic Range of Parameters -- 5 Security -- 5.1 Definitions -- 5.2 IND-CPA Proof -- 5.3 Known Attacks -- 6 Parameters -- 7 Conclusion and Future Work -- A Dimension of the Support of the Product of Homogeneous Matrices -- A.1 Preliminary Results on Binary Matrices -- A.2 Proof of Theorem 1 -- B Performance -- References.
Interleaved Prange: A New Generic Decoder for Interleaved Codes -- 1 Introduction -- 2 Preliminaries -- 3 Decoding Algorithms -- 3.1 SD-Based Algorithms -- 3.2 CF-Based Algorithms -- 3.3 Novel Approach: Interleaved Prange -- 3.4 Recognizing Failures -- 3.5 Comparison -- 4 Conclusion -- References -- A Study of Error Floor Behavior in QC-MDPC Codes -- 1 Introduction -- 2 Background -- 2.1 Coding Theory and QC-MDPC Codes -- 2.2 BIKE -- 2.3 Weak Keys and Near Codewords -- 3 Methods -- 4 Average DFR over Full Message Space -- 5 DFR on At,(S) Sets -- 6 Distribution of Syndrome Weight -- 7 Conclusion -- References -- Multivariate Cryptography and the MinRank Problem -- Improvement of Algebraic Attacks for Solving Superdetermined MinRank Instances -- 1 Introduction -- 2 Notation and Preliminaries -- 3 Relations Between the Various Modelings -- 4 Complexity of Solving Superdetermined Systems -- 5 Application to DAGS -- 5.1 Principle of the Attack -- 5.2 Original Modeling -- 5.3 Modeling Update -- A Appendix -- References -- A New Fault Attack on UOV Multivariate Signature Scheme -- 1 Introduction -- 2 Preliminaries -- 2.1 Multivariate Signature Schemes -- 2.2 Unbalanced Oil and Vinegar Signature Scheme -- 2.3 Attacks on UOV -- 2.4 Existing Fault Attacks on UOV or Its Variant -- 3 New Fault Attack on UOV -- 3.1 Attack Model -- 3.2 Description -- 4 Analysis of Our Proposed Attack -- 4.1 Application of Key Recovery Attacks -- 4.2 Simulations of Our Proposed Attack -- 4.3 Limited Faults Cases -- 5 Conclusion -- References -- MR-DSS - Smaller MinRank-Based (Ring-)Signatures -- 1 Introduction -- 1.1 Related Work -- 1.2 Contribution -- 2 Preliminaries -- 2.1 Sigma Protocols with Helper -- 2.2 Commitment Schemes -- 3 The Sigma Protocol of Courtois -- 4 Improved MinRank-Based Signature Scheme -- 4.1 Sigma Protocol with Helper for ZK Proof of MinRank. 4.2 Removing the Helper -- 4.3 Further Improvements -- 4.4 Public Key Size -- 4.5 Signature Size -- 4.6 Parameters -- 5 MinRank-Based Ring Signatures -- 5.1 Extending to Ring Signatures -- 5.2 Parameters of the Scheme -- 5.3 Public Key and Signature Size -- A Commitment Scheme -- B Ring Signatures -- B.1 Security Definitions -- B.2 Proofs -- C A Note on Santoso et al.'s Scheme -- References -- IPRainbow -- 1 Introduction -- 2 UOV and Rainbow -- 2.1 Oil and Vinegar -- 2.2 Rainbow -- 3 Known Attacks of Rainbow -- 3.1 Background -- 3.2 Rectangular MinRank Attack -- 3.3 Simple Attack -- 4 IPRainbow -- 4.1 Description of IPRainbow -- 4.2 Security Analysis -- 4.3 Efficiency and Key Size -- 5 Conclusion -- A Algorithms -- References -- 2F - A New Method for Constructing Efficient Multivariate Encryption Schemes -- 1 Introduction -- 2 Multivariate Encryption Schemes -- 2.1 HFE -- 2.2 SQUARE -- 2.3 ABC Simple Matrix -- 2.4 PCBM -- 3 2F Modulus Switching -- 4 An Instance of 2F Multivariate Encryption -- 5 Security Analysis -- 5.1 MinRank Attacks -- 5.2 Differential -- 5.3 Direct -- 5.4 Lattice Attacks -- 6 Parameters and Performance -- 7 Conclusion -- References -- Quantum Algorithms, Attacks and Models -- Quantum Attacks on Lai-Massey Structure -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 Pseudo-Random Permutation -- 2.3 Quantum Algorithms -- 3 Quantum Attacks on Lai-Massey Structures -- 3.1 Quantum Chosen-Plaintext Attack Against 3-Round Lai-Massey Structure -- 3.2 Quantum Chosen-Ciphertext Attack Against 4 Round Lai-Massey Structure -- 3.3 Quantum Key-Recovery Attack on 4-Round Lai-Massey Structure -- 4 Lai-Massey and Quasi-Feistel Structures -- 4.1 Quasi-Feistel Structure -- 4.2 Lai-Massey and Quasi-Feistel Structures -- 5 Quantum Attacks Against Quasi-Feistel Structures. 5.1 Quantum Chosen-Plaintext Attack Against 3-Round Quasi-Feistel Structure -- 5.2 Quantum Chosen-Ciphertext Attack Against 4-Round Quasi-Feistel Structure -- 6 Conclusion and Discussion -- A Intermediate Parameters in the Decryption Process of 4-round Lai-Massey Structure in Sect.3.2 -- B Proof of Theorem 4 -- References -- Sponge-Based Authenticated Encryption: Security Against Quantum Attackers -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 Definitions -- 3 The Sponge Construction and Slae -- 3.1 Sponge Construction -- 3.2 The FGHF' Construction and Slae -- 4 Post-Quantum (QS1) Security -- 4.1 Security of SlFunc -- 4.2 Security of SPrg -- 4.3 Security of SvHash -- 4.4 Security of Slae -- 5 Quantum (QS2) Security -- 5.1 QS2 Security Notions for SKE -- 5.2 Left-or-Right Security of SlEnc -- 5.3 Real-or-Random Security of SlEnc -- 5.4 IND-qCPA Security of Slae and FGHF' -- 6 Conclusion -- A Additional Preliminaries -- A.1 Authenticated Encryption -- A.2 Message Authentication Code -- A.3 Hash Function -- B QS1 Proofs -- B.1 Proof of Theorem 8 -- B.2 Proof of Theorem 9 -- B.3 Proof of Theorem 10 -- B.4 Proof of Theorem 11 -- B.5 Proof of Theorem 12 -- C QS2 Proofs -- C.1 Proof of Theorem 14 -- References -- Post-quantum Plaintext-Awareness -- 1 Introduction -- 1.1 Motivation -- 1.2 Challenges and Our Contribution -- 1.3 Our Contribution -- 1.4 Organization -- 2 Preliminaries -- 2.1 Definitions -- 3 Post-quantum Plaintext-Awareness -- 3.1 Post-quantum PA0, PA1 -- 3.2 Post-quantum PA2 -- 4 Relationships Between Notions -- 4.1 Relationships Between PA Notions -- 4.2 Relation with IND-qCCA -- 5 Achievability -- A Preliminaries -- A.1 Commitment Scheme -- A.2 Basics of Quantum Computing -- B Discussion on Quantum Eavesdropping -- C Proof of Theorem 8 -- D Achievability -- D.1 OAEP transform -- References. On Quantum Ciphertext Indistinguishability, Recoverability, and OAEP -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 1.3 Outline -- 2 Preliminaries -- 2.1 Notation -- 2.2 Public-Key Cryptography -- 2.3 Quantum Computing -- 3 (Quantum) Ciphertext Indistinguishability -- 3.1 The qINDqCPA Security Notion -- 3.2 Interpretation of Ciphertext Indistinguishability -- 4 Observations on Recoverability -- 4.1 Recoverability -- 4.2 Equivalent Recoverable PKE Schemes -- 5 OAEP -- 5.1 Recoverability of OAEP -- 5.2 Quantum Operators for OAEP -- References -- Implementation and Side Channel Attacks -- Efficiently Masking Polynomial Inversion at Arbitrary Order -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 Masking -- 2.3 Polynomial Inversion Applications -- 3 Masking Polynomial Inversion -- 3.1 Conversion from Additive to Multiplicative Sharing -- 3.2 Conversion from Multiplicative to Additive Sharing -- 3.3 Reducing the Number of Inversions -- 3.4 Reducing the Number of Multiplications -- 4 Implementation and Evaluation -- 4.1 Implementation Results -- 4.2 Side-Channel Evaluation -- 5 Conclusion -- References -- A Power Side-Channel Attack on the Reed-Muller Reed-Solomon Version of the HQC Cryptosystem -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 HQC -- 2.3 Choice of Error Correcting Code C -- 3 Novel Oracle-Based Side-Channel Attack -- 3.1 Support Distribution of y -- 3.2 General Attack Idea -- 3.3 Description of the Attack Strategy -- 3.4 Retrieval of y from Partial Information with Information Set Decoding -- 4 Side-Channel Targets to Build the Required Oracle -- 4.1 Power Side-Channel of the RS Decoder -- 4.2 Power Side-Channel of the Used Hash Functions G,H -- 4.3 Timing Side-Channel of the Used Sampler -- 5 Conclusion -- A Counterexample to the Attack Strategy in ch16Ueno2021,ch16Xagawa21archive. B Modified Variant of Stern's Algorithm. |
Record Nr. | UNISA-996490354403316 |
Cham, Switzerland : , : Springer International Publishing, , [2022] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|