top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Advances in Cryptology -- ASIACRYPT 2014 [[electronic resource] ] : 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, December 7-11, 2014, Part II / / edited by Palash Sarkar, Tetsu Iwata
Advances in Cryptology -- ASIACRYPT 2014 [[electronic resource] ] : 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, December 7-11, 2014, Part II / / edited by Palash Sarkar, Tetsu Iwata
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XXII, 528 p. 76 illus.)
Disciplina 005.82
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer security
Coding theory
Information theory
Management information systems
Computer science
Computers
Computer science—Mathematics
Cryptology
Systems and Data Security
Coding and Information Theory
Management of Computing and Information Systems
Theory of Computation
Mathematics of Computing
ISBN 3-662-45608-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cryptology and coding theory -- Authenticated encryption -- Symmetric key cryptanalysis -- Side channel analysis -- Hyperelliptic curve cryptography -- Factoring and discrete log -- Cryptanalysis -- Signatures -- Zero knowledge -- Encryption schemes -- Outsourcing and delegation -- Obfuscation -- Homomorphic cryptography -- Secret sharing -- Block ciphers and passwords -- Black-box separation -- Composability -- Multi-party computation.
Record Nr. UNISA-996210509203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in Cryptology -- ASIACRYPT 2014 [[electronic resource] ] : 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, December 7-11, 2014, Proceedings, Part I / / edited by Palash Sarkar, Tetsu Iwata
Advances in Cryptology -- ASIACRYPT 2014 [[electronic resource] ] : 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, December 7-11, 2014, Proceedings, Part I / / edited by Palash Sarkar, Tetsu Iwata
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XX, 574 p. 74 illus.)
Disciplina 005.8
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer security
Coding theory
Information theory
Management information systems
Computer science
Computers
Computer science—Mathematics
Cryptology
Systems and Data Security
Coding and Information Theory
Management of Computing and Information Systems
Theory of Computation
Mathematics of Computing
ISBN 3-662-45611-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cryptology and coding theory -- Authenticated encryption -- Symmetric key cryptanalysis -- Side channel analysis -- Hyperelliptic curve cryptography -- Factoring and discrete log -- Cryptanalysis -- Signatures -- Zero knowledge -- Encryption schemes -- Outsourcing and delegation -- Obfuscation -- Homomorphic cryptography -- Secret sharing -- Block ciphers and passwords -- Black-box separation -- Composability -- Multi-party computation.
Record Nr. UNISA-996210508903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in Cryptology -- ASIACRYPT 2014 : 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, December 7-11, 2014, Proceedings, Part I / / edited by Palash Sarkar, Tetsu Iwata
Advances in Cryptology -- ASIACRYPT 2014 : 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, December 7-11, 2014, Proceedings, Part I / / edited by Palash Sarkar, Tetsu Iwata
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XX, 574 p. 74 illus.)
Disciplina 005.8
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer security
Coding theory
Information theory
Management information systems
Computer science
Computers
Computer science—Mathematics
Cryptology
Systems and Data Security
Coding and Information Theory
Management of Computing and Information Systems
Theory of Computation
Mathematics of Computing
ISBN 3-662-45611-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cryptology and coding theory -- Authenticated encryption -- Symmetric key cryptanalysis -- Side channel analysis -- Hyperelliptic curve cryptography -- Factoring and discrete log -- Cryptanalysis -- Signatures -- Zero knowledge -- Encryption schemes -- Outsourcing and delegation -- Obfuscation -- Homomorphic cryptography -- Secret sharing -- Block ciphers and passwords -- Black-box separation -- Composability -- Multi-party computation.
Record Nr. UNINA-9910482998003321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in Cryptology -- ASIACRYPT 2014 : 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, December 7-11, 2014, Part II / / edited by Palash Sarkar, Tetsu Iwata
Advances in Cryptology -- ASIACRYPT 2014 : 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, December 7-11, 2014, Part II / / edited by Palash Sarkar, Tetsu Iwata
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XXII, 528 p. 76 illus.)
Disciplina 005.82
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer security
Coding theory
Information theory
Management information systems
Computer science
Computers
Computer science—Mathematics
Cryptology
Systems and Data Security
Coding and Information Theory
Management of Computing and Information Systems
Theory of Computation
Mathematics of Computing
ISBN 3-662-45608-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cryptology and coding theory -- Authenticated encryption -- Symmetric key cryptanalysis -- Side channel analysis -- Hyperelliptic curve cryptography -- Factoring and discrete log -- Cryptanalysis -- Signatures -- Zero knowledge -- Encryption schemes -- Outsourcing and delegation -- Obfuscation -- Homomorphic cryptography -- Secret sharing -- Block ciphers and passwords -- Black-box separation -- Composability -- Multi-party computation.
Record Nr. UNINA-9910484064703321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in Cryptology -- ASIACRYPT 2015 [[electronic resource] ] : 21st International Conference on the Theory and Application of Cryptology and Information Security,Auckland, New Zealand, November 29 -- December 3, 2015, Proceedings, Part I / / edited by Tetsu Iwata, Jung Hee Cheon
Advances in Cryptology -- ASIACRYPT 2015 [[electronic resource] ] : 21st International Conference on the Theory and Application of Cryptology and Information Security,Auckland, New Zealand, November 29 -- December 3, 2015, Proceedings, Part I / / edited by Tetsu Iwata, Jung Hee Cheon
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XXV, 810 p. 93 illus.)
Disciplina 005.82
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer security
Coding theory
Information theory
Management information systems
Computer science
Computers
Computer science—Mathematics
Cryptology
Systems and Data Security
Coding and Information Theory
Management of Computing and Information Systems
Theory of Computation
Mathematics of Computing
ISBN 3-662-48797-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- ASIACRYPT 2015 -- Invited Talks -- Structure-Preserving Cryptography -- Computer-Aided Cryptography:Status and Perspectives -- The Moral Character of Cryptographic Work -- Contents - Part I -- Contents - Part II -- Best Paper -- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance -- 1 Introduction -- 2 Preliminaries -- 2.1 Lattices -- 2.2 The SIS and LWE Problems -- 2.3 The Rényi Divergence -- 2.4 RD Bounds -- 3 Application to Lattice-Based Signature Schemes -- 3.1 Sampling Discrete Gaussians and the BLISS Signature Scheme -- 3.2 GPV Signature Scheme -- 4 Rényi Divergence and Distinguishing Problems -- 4.1 Problems with Public Sampleability -- 4.2 Application to Dual-Regev Encryption -- 5 Application to LWE with Uniform Noise -- 6 Open Problems -- References -- Indistinguishability Obfuscation -- Multi-input Functional Encryption for Unbounded Arity Functions -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 2 Preliminaries -- 2.1 Public-Coin Differing-Inputs Obfuscation -- 2.2 Non Interactive Proof Systems -- 2.3 Collision Resistent Hash Functions -- 3 Unbounded Arity Multi-input Functional Encryption -- 3.1 Syntax -- 3.2 Security Definition -- 4 A Construction from Public-Coin Differing-Inputs Obfuscation -- 5 Security Proof -- References -- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Other Related Work -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation and PRFs -- 2.2 Somewhere Statistically Binding Hash -- 3 Definitions -- 4 Static Secure NIKE for Unbounded Parties -- 4.1 Construction -- 4.2 Security Game and Hybrids -- 4.3 Removing the Setup -- 5 ID-NIKE for Unbounded Parties -- 5.1 Construction.
5.2 Security Game and Hybrids -- 6 Conclusion -- A NIKE: Proofs of Indistinguishability of the Hybrids -- References -- PRFs and Hashes -- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model -- 1 Introduction -- 2 Preliminaries -- 2.1 Assumptions -- 3 Constrained Pseudorandom Functions -- 3.1 Puncturable Pseudorandom Functions -- 4 Construction -- 4.1 Proof of Security -- 5 t-Puncturable PRFs -- 5.1 Construction -- 5.2 Proof of Security -- 6 Conclusion -- References -- Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security -- 1 Introduction -- 2 Definitions -- 3 Polynomial Linear Pseudorandomness Security -- 3.1 Intuition -- 3.2 Formal Security Notion and Theorem -- 4 Applications -- 4.1 Aggregate Pseudorandom Functions -- 4.2 Multilinear Pseudorandom Functions -- References -- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators -- 1 Introduction -- 1.1 Our Results -- 2 Preliminaries -- 3 Two-to-One SSB Hash -- 3.1 Two-to-One SSB Hash from DDH -- 3.2 Two-to-One SSB Hash from DCR -- 3.3 SSB with Local Opening from Two-to-One SSB -- 4 SSB Hash from Lossy Functions -- 5 SSB from -hiding -- 5.1 RSA and -hiding Preliminaries -- 5.2 Conforming Function -- 5.3 Our -hiding SSB Construction -- 6 Positional Accumulators -- A Constructing a Conforming Function -- References -- Discrete Logarithms and Number Theory -- Computing Individual Discrete Logarithms Faster in `39`42`"613A``45`47`"603AGF(pn) with the NFS-DL Algorithm -- 1 Introduction -- 1.1 Cryptographic Interest -- 1.2 The Number Field Sieve Algorithm for DL in Finite Fields -- 1.3 Previous Work on Individual Discrete Logarithm -- 1.4 Our Contributions -- 1.5 Outline -- 2 Preliminaries -- 2.1 Polynomial Selection Methods -- 2.2 Norm Upper Bound in a Number Field.
2.3 Joux--Lercier--Smart--Vercauteren Fraction Method -- 3 Asymptotic Complexity of Individual DL Computation -- 3.1 Asymptotic Complexity of Initialization or Booting Step -- 3.2 Running-Time of Special-q Descent -- 4 Computing a Preimage in the Number Field -- 4.1 Preimage Computation in the JLSV1 Case -- 4.2 Preimage Computation in the gJL and Conjugation Cases -- 5 Preimages of Smaller Norm with Quadratic Subfields -- 5.1 Smaller Preimage Degree -- 5.2 Smaller Preimage Norm -- 5.3 Summary of Results -- 6 Practical Examples -- 6.1 Examples for Small n and pn of 180 Decimal Digits (dd) -- 6.2 Experiments: Finding Boots for Fp4 of 120 dd -- 7 Conclusion -- References -- Multiple Discrete Logarithm Problems with Auxiliary Inputs -- 1 Introduction -- 2 Discrete Logarithm Problem and Related Problems -- 3 Multiple DLPwAI: Cheon's Algorithm -- 3.1 Reduction of DLPwAI to DLP in the Exponent Using Cheon's Algorithm -- 3.2 Algorithm for Multiple DLP in the Exponent -- 3.3 Solving Multiple DLPwAI Using Cheon's Algorithm -- 4 Multiple DLPwAI: Kim and Cheon's Algorithm -- 4.1 Description of Algorithm -- 4.2 Complexity Analysis -- 4.3 Explicit Choices of Polynomials for Efficient Algorithms in the Case Of d P 1 -- 5 Conclusion -- A A Failed Approach for MDLPwAI When d P+1 -- B Non-uniform Birthday Problem: Girls and Boys -- References -- Solving Linear Equations Modulo Unknown Divisors: Revisited -- 1 Introduction -- 1.1 Our Contributions -- 2 Preliminary -- 3 The First Type of Equations -- 3.1 Our Main Result -- 3.2 Analysis of Multi-power RSA -- 4 The Second Type of Equations -- 4.1 Our Main Result -- 4.2 Applications -- 5 The Third Type of Equations -- 5.1 Our Main Result -- 5.2 Common Prime RSA -- 6 Conclusion -- References -- FourQ: Four-Dimensional Decompositions on a Q-curve over the Mersenne Prime -- 1 Introduction -- 2 The Curve: FourQ.
2.1 A Complete Twisted Edwards Curve -- 2.2 Where did this Curve Come From? -- 2.3 The Cryptographic Security of FourQ -- 3 The Endomorphisms and -- 3.1 Explicit Formulas for -- 3.2 Deriving Explicit Formulas for -- 3.3 Eigenvalues -- 3.4 Section Summary -- 4 Optimal Scalar Decompositions -- 4.1 Babai Rounding and Optimal Bases -- 4.2 Handling Round-Off Errors -- 4.3 All-Positive Multiscalars -- 5 The Scalar Multiplication -- 5.1 Recoding the Multiscalar -- 5.2 The Full Routine -- 6 Performance Analysis and Results -- 6.1 Operation Counts -- 6.2 Experimental Results -- References -- Signatures -- Efficient Fully Structure-Preserving Signatures for Large Messages -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Bilinear Groups -- 2.2 Signature Schemes -- 2.3 Structure-Preserving Signature Schemes -- 3 Randomizable and Strongly Unforgeable Signatures -- 4 Structure-Preserving Combined Signature Scheme -- 5 Fully Structure-Preserving Combined Signature Scheme -- References -- A Provably Secure Group Signature Scheme from Code-Based Assumptions -- 1 Introduction -- 1.1 Background and Motivation -- 1.2 Our Contributions -- 1.3 Overview of Our Techniques -- 1.4 Related Works and Open Questions -- 2 Preliminaries -- 2.1 Background on Code-Based Cryptography -- 2.2 Group Signatures -- 3 The Underlying Zero-Knowledge Argument System -- 3.1 The Interactive Protocol -- 3.2 Analysis of the Protocol -- 4 Our Code-Based Group Signature Scheme -- 4.1 Description of the Scheme -- 4.2 Efficiency and Correctness -- 4.3 Anonymity -- 4.4 Traceability -- 5 Implementation Results -- References -- Type 2 Structure-Preserving Signature Schemes Revisited -- 1 Introduction -- 2 Asymmetric Bilinear Pairings -- 3 Strongly Unforgeable Structure-Preserving Signatures -- 3.1 Type 2 Strongly Unforgeable SPS [4].
3.2 Type 3 Strongly Unforgeable SPS -- 3.3 Comparisons -- 4 Randomizable Structure-Preserving Signatures -- 4.1 Type 2 Randomizable SPS [4] -- 4.2 Type 3 Randomizable SPS -- 4.3 Comparisons -- 4.4 Strongly-Optimal Signatures -- 5 A Closer Look at Type 2 Schemes -- 5.1 Conversion from Type 2 to Type 3 -- 5.2 Impossibility of Single PPE in Verification -- 5.3 Separation -- 5.4 Type 2: A Designer's Artifact? -- 6 Concluding Remarks -- A Groth-Sahai Proofs -- A.1 DLIN-Based Proofs -- A.2 DDH-Based Proofs -- References -- Design Principles for HFEv- Based Multivariate Signature Schemes -- 1 Introduction -- 2 Multivariate Cryptography -- 3 The HFEv- Signature Scheme -- 3.1 QUARTZ -- 3.2 Performance -- 3.3 Security of HFEv- Based Schemes -- 4 Design Principles for HFEv- Based Signature Schemes -- 4.1 Can We Use HFE Polynomials of Low Degree D? -- 4.2 Is the Ratio Between a and v Important for the Security of the Scheme? -- 4.3 Is the Upper Bound on dreg Given by Eq.(12) Reasonably Tight? -- 4.4 Does it Help to Guess Some Variables Before Applying a Gröbner Basis Algorithm? -- 5 The New Multivariate Signature Scheme Gui -- 5.1 Signature Generation -- 5.2 Signature Verification -- 6 Implementation and Comparison -- 6.1 Arithmetics Over Finite Fields -- 6.2 Inverting the HFEv- Core -- 6.3 Experiments and Comparison -- 6.4 Platforms Without PCLMULQDQ -- 6.5 Grover's Algorithm and Potential Extension to Larger Fields -- 7 Conclusion and Future Work -- References -- Multiparty Computation I -- Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness -- 1 Introduction -- 1.1 Practical Applications -- 1.2 Background: The PRAM Model -- 1.3 Results and Contributions -- 1.4 Technical Highlights -- 1.5 Related Work -- 2 Definitions -- 2.1 Background: Random Access Machines (RAM) -- 2.2 Network RAM (NRAM) -- 2.3 Oblivious Network RAM (O-NRAM).
2.4 Notion of Simulation.
Record Nr. UNISA-996466193303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in Cryptology -- ASIACRYPT 2015 : 21st International Conference on the Theory and Application of Cryptology and Information Security,Auckland, New Zealand, November 29 -- December 3, 2015, Proceedings, Part I / / edited by Tetsu Iwata, Jung Hee Cheon
Advances in Cryptology -- ASIACRYPT 2015 : 21st International Conference on the Theory and Application of Cryptology and Information Security,Auckland, New Zealand, November 29 -- December 3, 2015, Proceedings, Part I / / edited by Tetsu Iwata, Jung Hee Cheon
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XXV, 810 p. 93 illus.)
Disciplina 005.82
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer security
Coding theory
Information theory
Management information systems
Computer science
Computers
Computer science—Mathematics
Cryptology
Systems and Data Security
Coding and Information Theory
Management of Computing and Information Systems
Theory of Computation
Mathematics of Computing
ISBN 3-662-48797-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- ASIACRYPT 2015 -- Invited Talks -- Structure-Preserving Cryptography -- Computer-Aided Cryptography:Status and Perspectives -- The Moral Character of Cryptographic Work -- Contents - Part I -- Contents - Part II -- Best Paper -- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance -- 1 Introduction -- 2 Preliminaries -- 2.1 Lattices -- 2.2 The SIS and LWE Problems -- 2.3 The Rényi Divergence -- 2.4 RD Bounds -- 3 Application to Lattice-Based Signature Schemes -- 3.1 Sampling Discrete Gaussians and the BLISS Signature Scheme -- 3.2 GPV Signature Scheme -- 4 Rényi Divergence and Distinguishing Problems -- 4.1 Problems with Public Sampleability -- 4.2 Application to Dual-Regev Encryption -- 5 Application to LWE with Uniform Noise -- 6 Open Problems -- References -- Indistinguishability Obfuscation -- Multi-input Functional Encryption for Unbounded Arity Functions -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 2 Preliminaries -- 2.1 Public-Coin Differing-Inputs Obfuscation -- 2.2 Non Interactive Proof Systems -- 2.3 Collision Resistent Hash Functions -- 3 Unbounded Arity Multi-input Functional Encryption -- 3.1 Syntax -- 3.2 Security Definition -- 4 A Construction from Public-Coin Differing-Inputs Obfuscation -- 5 Security Proof -- References -- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Other Related Work -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation and PRFs -- 2.2 Somewhere Statistically Binding Hash -- 3 Definitions -- 4 Static Secure NIKE for Unbounded Parties -- 4.1 Construction -- 4.2 Security Game and Hybrids -- 4.3 Removing the Setup -- 5 ID-NIKE for Unbounded Parties -- 5.1 Construction.
5.2 Security Game and Hybrids -- 6 Conclusion -- A NIKE: Proofs of Indistinguishability of the Hybrids -- References -- PRFs and Hashes -- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model -- 1 Introduction -- 2 Preliminaries -- 2.1 Assumptions -- 3 Constrained Pseudorandom Functions -- 3.1 Puncturable Pseudorandom Functions -- 4 Construction -- 4.1 Proof of Security -- 5 t-Puncturable PRFs -- 5.1 Construction -- 5.2 Proof of Security -- 6 Conclusion -- References -- Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security -- 1 Introduction -- 2 Definitions -- 3 Polynomial Linear Pseudorandomness Security -- 3.1 Intuition -- 3.2 Formal Security Notion and Theorem -- 4 Applications -- 4.1 Aggregate Pseudorandom Functions -- 4.2 Multilinear Pseudorandom Functions -- References -- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators -- 1 Introduction -- 1.1 Our Results -- 2 Preliminaries -- 3 Two-to-One SSB Hash -- 3.1 Two-to-One SSB Hash from DDH -- 3.2 Two-to-One SSB Hash from DCR -- 3.3 SSB with Local Opening from Two-to-One SSB -- 4 SSB Hash from Lossy Functions -- 5 SSB from -hiding -- 5.1 RSA and -hiding Preliminaries -- 5.2 Conforming Function -- 5.3 Our -hiding SSB Construction -- 6 Positional Accumulators -- A Constructing a Conforming Function -- References -- Discrete Logarithms and Number Theory -- Computing Individual Discrete Logarithms Faster in `39`42`"613A``45`47`"603AGF(pn) with the NFS-DL Algorithm -- 1 Introduction -- 1.1 Cryptographic Interest -- 1.2 The Number Field Sieve Algorithm for DL in Finite Fields -- 1.3 Previous Work on Individual Discrete Logarithm -- 1.4 Our Contributions -- 1.5 Outline -- 2 Preliminaries -- 2.1 Polynomial Selection Methods -- 2.2 Norm Upper Bound in a Number Field.
2.3 Joux--Lercier--Smart--Vercauteren Fraction Method -- 3 Asymptotic Complexity of Individual DL Computation -- 3.1 Asymptotic Complexity of Initialization or Booting Step -- 3.2 Running-Time of Special-q Descent -- 4 Computing a Preimage in the Number Field -- 4.1 Preimage Computation in the JLSV1 Case -- 4.2 Preimage Computation in the gJL and Conjugation Cases -- 5 Preimages of Smaller Norm with Quadratic Subfields -- 5.1 Smaller Preimage Degree -- 5.2 Smaller Preimage Norm -- 5.3 Summary of Results -- 6 Practical Examples -- 6.1 Examples for Small n and pn of 180 Decimal Digits (dd) -- 6.2 Experiments: Finding Boots for Fp4 of 120 dd -- 7 Conclusion -- References -- Multiple Discrete Logarithm Problems with Auxiliary Inputs -- 1 Introduction -- 2 Discrete Logarithm Problem and Related Problems -- 3 Multiple DLPwAI: Cheon's Algorithm -- 3.1 Reduction of DLPwAI to DLP in the Exponent Using Cheon's Algorithm -- 3.2 Algorithm for Multiple DLP in the Exponent -- 3.3 Solving Multiple DLPwAI Using Cheon's Algorithm -- 4 Multiple DLPwAI: Kim and Cheon's Algorithm -- 4.1 Description of Algorithm -- 4.2 Complexity Analysis -- 4.3 Explicit Choices of Polynomials for Efficient Algorithms in the Case Of d P 1 -- 5 Conclusion -- A A Failed Approach for MDLPwAI When d P+1 -- B Non-uniform Birthday Problem: Girls and Boys -- References -- Solving Linear Equations Modulo Unknown Divisors: Revisited -- 1 Introduction -- 1.1 Our Contributions -- 2 Preliminary -- 3 The First Type of Equations -- 3.1 Our Main Result -- 3.2 Analysis of Multi-power RSA -- 4 The Second Type of Equations -- 4.1 Our Main Result -- 4.2 Applications -- 5 The Third Type of Equations -- 5.1 Our Main Result -- 5.2 Common Prime RSA -- 6 Conclusion -- References -- FourQ: Four-Dimensional Decompositions on a Q-curve over the Mersenne Prime -- 1 Introduction -- 2 The Curve: FourQ.
2.1 A Complete Twisted Edwards Curve -- 2.2 Where did this Curve Come From? -- 2.3 The Cryptographic Security of FourQ -- 3 The Endomorphisms and -- 3.1 Explicit Formulas for -- 3.2 Deriving Explicit Formulas for -- 3.3 Eigenvalues -- 3.4 Section Summary -- 4 Optimal Scalar Decompositions -- 4.1 Babai Rounding and Optimal Bases -- 4.2 Handling Round-Off Errors -- 4.3 All-Positive Multiscalars -- 5 The Scalar Multiplication -- 5.1 Recoding the Multiscalar -- 5.2 The Full Routine -- 6 Performance Analysis and Results -- 6.1 Operation Counts -- 6.2 Experimental Results -- References -- Signatures -- Efficient Fully Structure-Preserving Signatures for Large Messages -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Bilinear Groups -- 2.2 Signature Schemes -- 2.3 Structure-Preserving Signature Schemes -- 3 Randomizable and Strongly Unforgeable Signatures -- 4 Structure-Preserving Combined Signature Scheme -- 5 Fully Structure-Preserving Combined Signature Scheme -- References -- A Provably Secure Group Signature Scheme from Code-Based Assumptions -- 1 Introduction -- 1.1 Background and Motivation -- 1.2 Our Contributions -- 1.3 Overview of Our Techniques -- 1.4 Related Works and Open Questions -- 2 Preliminaries -- 2.1 Background on Code-Based Cryptography -- 2.2 Group Signatures -- 3 The Underlying Zero-Knowledge Argument System -- 3.1 The Interactive Protocol -- 3.2 Analysis of the Protocol -- 4 Our Code-Based Group Signature Scheme -- 4.1 Description of the Scheme -- 4.2 Efficiency and Correctness -- 4.3 Anonymity -- 4.4 Traceability -- 5 Implementation Results -- References -- Type 2 Structure-Preserving Signature Schemes Revisited -- 1 Introduction -- 2 Asymmetric Bilinear Pairings -- 3 Strongly Unforgeable Structure-Preserving Signatures -- 3.1 Type 2 Strongly Unforgeable SPS [4].
3.2 Type 3 Strongly Unforgeable SPS -- 3.3 Comparisons -- 4 Randomizable Structure-Preserving Signatures -- 4.1 Type 2 Randomizable SPS [4] -- 4.2 Type 3 Randomizable SPS -- 4.3 Comparisons -- 4.4 Strongly-Optimal Signatures -- 5 A Closer Look at Type 2 Schemes -- 5.1 Conversion from Type 2 to Type 3 -- 5.2 Impossibility of Single PPE in Verification -- 5.3 Separation -- 5.4 Type 2: A Designer's Artifact? -- 6 Concluding Remarks -- A Groth-Sahai Proofs -- A.1 DLIN-Based Proofs -- A.2 DDH-Based Proofs -- References -- Design Principles for HFEv- Based Multivariate Signature Schemes -- 1 Introduction -- 2 Multivariate Cryptography -- 3 The HFEv- Signature Scheme -- 3.1 QUARTZ -- 3.2 Performance -- 3.3 Security of HFEv- Based Schemes -- 4 Design Principles for HFEv- Based Signature Schemes -- 4.1 Can We Use HFE Polynomials of Low Degree D? -- 4.2 Is the Ratio Between a and v Important for the Security of the Scheme? -- 4.3 Is the Upper Bound on dreg Given by Eq.(12) Reasonably Tight? -- 4.4 Does it Help to Guess Some Variables Before Applying a Gröbner Basis Algorithm? -- 5 The New Multivariate Signature Scheme Gui -- 5.1 Signature Generation -- 5.2 Signature Verification -- 6 Implementation and Comparison -- 6.1 Arithmetics Over Finite Fields -- 6.2 Inverting the HFEv- Core -- 6.3 Experiments and Comparison -- 6.4 Platforms Without PCLMULQDQ -- 6.5 Grover's Algorithm and Potential Extension to Larger Fields -- 7 Conclusion and Future Work -- References -- Multiparty Computation I -- Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness -- 1 Introduction -- 1.1 Practical Applications -- 1.2 Background: The PRAM Model -- 1.3 Results and Contributions -- 1.4 Technical Highlights -- 1.5 Related Work -- 2 Definitions -- 2.1 Background: Random Access Machines (RAM) -- 2.2 Network RAM (NRAM) -- 2.3 Oblivious Network RAM (O-NRAM).
2.4 Notion of Simulation.
Record Nr. UNINA-9910484739503321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in Cryptology – ASIACRYPT 2015 [[electronic resource] ] : 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 -- December 3, 2015, Proceedings, Part II / / edited by Tetsu Iwata, Jung Hee Cheon
Advances in Cryptology – ASIACRYPT 2015 [[electronic resource] ] : 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 -- December 3, 2015, Proceedings, Part II / / edited by Tetsu Iwata, Jung Hee Cheon
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XXV, 802 p. 124 illus.)
Disciplina 005.82
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer security
Coding theory
Information theory
Management information systems
Computer science
Computers
Computer science—Mathematics
Cryptology
Systems and Data Security
Coding and Information Theory
Management of Computing and Information Systems
Theory of Computation
Mathematics of Computing
ISBN 3-662-48800-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- ASIACRYPT 2015 -- Invited Talks -- Structure-Preserving Cryptography -- Computer-Aided Cryptography: Status and Perspectives -- The Moral Character of Cryptographic Work -- Contents - Part II -- Contents - Part I -- Attacks on ASASA -- Key-Recovery Attacks on ASASA -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Structure of the Article -- 1.3 Implementation and Full Version -- 2 Notation and Preliminaries -- 3 Description of ASASA schemes -- 3.1 Presentation and Notations -- 3.2 Description of the Black-Box Scheme -- 3.3 Description of the White-Box Scheme -- 3.4 Description of the -based Public-Key Scheme -- 4 Structural Attack on Black-Box ASASA -- 4.1 Attack Overview -- 4.2 Description of the Attack -- 5 Attacks on the -based Public-Key Scheme -- 5.1 Algebraic Attack on the Scheme -- 5.2 LPN-based attack on the scheme -- 5.3 Peeling Off the Remaining ASAS layers -- 6 A Practical Attack on White-Box ASASA -- 6.1 Attack Overview -- 7 Conclusion -- References -- Number Field Sieve -- The Tower Number Field Sieve -- 1 Introduction -- 2 Overview of TNFS -- 3 Detailed Description and Analysis -- 3.1 Polynomial Selection -- 3.2 Relation Collection -- 3.3 Writing and Solving Linear Equations -- 3.4 Overall Complexity of the Main Phase -- 3.5 Individual Logarithms -- 4 Variants -- 5 Comparison for Cryptographically Relevant Sizes -- 5.1 The Case of General Primes -- 5.2 The Case of Primes of Special Shape (SNFS) -- 6 Cryptographic Consequences -- 7 Appendix: Technicalities -- 7.1 Special-q Sieving -- 7.2 Using a Cyclotomic Field for Q() -- 7.3 The Waterloo Improvement -- References -- Hashes and MACs -- On the Impact of Known-Key Attacks on Hash Functions -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Outline -- 2 Weak Cipher Model -- 2.1 Security Model -- 2.2 Random Weak Cipher -- 2.3 Random Abortable Weak Cipher.
3 Modeling Known-Key Attacks -- 4 Application to PGV Compression Functions -- 4.1 Collision Security -- 4.2 Preimage Security -- 5 Application to Grøstl Compression Function -- 5.1 Collision Security -- 5.2 Preimage Security -- 6 Application to Shrimpton-Stam Compression Function -- 6.1 Collision Security -- 6.2 Preimage Security -- 7 Conclusions -- A Proof of Theorem 2 -- References -- Generic Security of NMAC and HMAC with Input Whitening -- 1 Introduction -- 2 Preliminaries -- 3 The Whitened NMAC Construction -- 3.1 Basic Notation, Message Trees and Repetition Patterns -- 3.2 Interactions and Transcripts -- 3.3 The H-Coefficient Method -- 3.4 Good and Bad Transcripts -- 3.5 Probability of a C-f-collision -- 3.6 Probability of Repeated Outer Invocations -- 3.7 Good Transcripts and Putting Pieces Together -- 3.8 Tightness -- 3.9 Distinguishing-H Security of WNMAC -- 3.10 State Recovery for WNMAC -- 4 Whitening HMAC -- 5 The Dual WNMAC Construction -- References -- Symmetric Encryption -- On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes -- 1 Introduction -- 1.1 Brief Literature Survey -- 1.2 Our Contribution -- 2 Preliminaries -- 2.1 Useful Properties of Matrices -- 2.2 Security Definitions and Notation -- 2.3 Tools for Proving Security -- 3 Linear Mode -- 3.1 Linear Query and Mode -- 3.2 Keyed Constructions Based on Linear Mode -- 4 PRP and SPRP Distinguishing Attacks -- 4.1 PRP Distinguishing Attack on E with = 2a-2 -- 4.2 SPRP Distinguishing Attack on E with = 2a-1 -- 5 Security Analysis of Inverse-Free Single Key Construction -- 5.1 PRP Attack of Single-Key Inverse-Free Constructions Without Masking -- 5.2 PRP Security of Single-Key Luby-Rackoff with Masking -- 6 Conclusion -- References -- Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing -- 1 Introduction.
2 Preliminaries -- 2.1 Notation and General Definitions -- 2.2 Security Definitions -- 2.3 The H-Coefficients Technique -- 2.4 An Extended Sum-Capture Lemma -- 3 Beyond-Birthday-Bound Security -- 3.1 Statement of the Result and Discussion -- 3.2 Definition and Probability of Bad Transcripts -- 3.3 Analysis of Good Transcripts -- References -- An Inverse-Free Single-Keyed Tweakable Enciphering Scheme -- 1 Introduction -- 1.1 Our Contribution -- 2 Preliminaries -- 2.1 Tweakable Encryption Schemes -- 2.2 Pseudorandomness and Distinguishing Games -- 2.3 Domain Extensions and Coefficient H Technique -- 3 The FMix Construction -- 4 TSPRP Security Analysis of FMix -- 4.1 Good Views and Interpolation -- 4.2 Extension of FMix for Partial Block Input -- 5 Proof of Proposition 1 -- 5.1 Simulations -- 5.2 Admissibility -- 5.3 Basis and Extension -- 5.4 Extension Equations -- 5.5 Bringing It All Together -- 5.6 Proof of Lemma 1 -- 6 Conclusion and Future Works -- References -- Foundations -- On Black-Box Complexity of Universally Composable Security in the CRS Model -- 1 Introduction -- 1.1 Our Results -- 2 Preliminaries -- 2.1 Oblivious Transfer -- 2.2 UC Commitment Schemes -- 2.3 Extractable Commitments -- 3 Static UC Secure Computation -- 3.1 Static UC Oblivious Transfer -- 4 One-Sided Adaptive UC Secure Computation -- 5 Adaptive UC Secure Computation -- 5.1 UC Commitments from PKE with Oblivious Ciphertext Generation -- References -- Public Verifiability in the Covert Model (Almost) for Free -- 1 Introduction -- 1.1 Our Contribution -- 2 Preliminaries -- 2.1 Publicly Verifiable Covert Security -- 2.2 Signed Oblivious Transfer -- 3 Signed Oblivious Transfer Extension -- 3.1 Intuition for the Construction -- 3.2 Towards a Proof of Security -- 3.3 An EU-CMPRA Signature Scheme -- 3.4 Proof of Security -- 4 Our Complete PVC Protocol -- 5 Comparison with Prior Work.
References -- Limits of Extractability Assumptions with Distributional Auxiliary Input -- 1 Introduction -- 1.1 Proof Techniques -- 1.2 Removing Auxiliary Input in diO -- 1.3 Other Applications of the ``Succinct Punctured Program'' Technique -- 1.4 Overview of Paper -- 2 Preliminaries -- 2.1 Public-Coin Differing-Inputs Obfuscation -- 2.2 Extractable One-Way Functions -- 2.3 Succinct Non-Interactive Arguments of Knowledge (SNARKs) -- 2.4 Puncturable PRFs -- 3 Public-Coin Differing-Inputs Obfuscation or Extractable One-Way Functions -- 3.1 From PC-diO to Impossibility of Z-Auxiliary-Input EOWF -- 3.2 PC-diO or SNARKs -- References -- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions -- 1 Introduction -- 2 Definitions of Unlinkable Redactable Signatures -- 2.1 Property-Based Definitions for Unlinkable Redactable Signatures -- 2.2 Ideal Functionality for Unlinkable Redactable Signatures -- 2.3 Key Registration and UC Realizability -- 3 The Construction of Our Redactable Signature Scheme -- 3.1 Vector Commitments Simplified -- 3.2 Non-interactive Zero-Knowledge and Witness Indistinguishable Proof Systems -- 3.3 Our Redactable Signature Scheme -- 4 From Unlinkable Redactable Signatures to Anonymous Credentials -- 4.1 Algorithms of Our Anonymous Credential System -- 4.2 Ideal Functionality for Credentials -- 4.3 Instantiation and Efficiency Analysis -- References -- Side-Channel Attacks -- ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When? -- 1 Introduction -- 2 Background -- 2.1 Measurement Setup -- 2.2 Information Detection Tools -- 2.3 Gaussian Templates Attacks -- 2.4 Key Enumeration and Rank Estimation -- 2.5 Algebraic Side-Channel Attacks -- 2.6 Soft Analytical Side-Channel Attacks -- 3 Comparison with ASCA -- 3.1 Our Representation for SASCA -- 3.2 Comparison Setup.
3.3 Experimental Results -- 4 SASCA Against a Concrete AES Implementation -- 4.1 Profiling Step -- 4.2 Experimental Results -- 5 Comparison with DPA and Enumeration -- 5.1 Evaluation of Profiled Template Attacks -- 5.2 Comparing SASCA and DPA with Enumeration -- 6 Conclusion and Open Problems -- References -- Counting Keys in Parallel After a Side Channel Attack -- 1 Introduction -- 1.1 Evaluating Resistance Against Differential Power Analysis -- 1.2 Problem Statement and Notation -- 1.3 Outline and Our Contributions -- 1.4 Previous Work -- 2 Casting the Key Enumeration as a Knapsack -- 3 An Accurate Key Rank Algorithm -- 3.1 Key Rank Graph -- 3.2 Counting Valid Paths -- 4 Parallelisable Key Enumeration Algorithm -- 4.1 Time Complexity -- 4.2 Memory Efficiency -- 4.3 Parallelisation -- 5 Practical Evaluation and Comparison with Previous Work -- 5.1 Evaluating and Comparing Precision -- 5.2 Evaluating and Comparing Run Times for Key Rank -- 5.3 Evaluating and Comparing Run Times for Key Enumeration -- A Computing Environment -- References -- A Unified Metric for Quantifying Information Leakage of Cryptographic Devices Under Power Analysis Attacks -- 1 Introduction -- 2 Leakage Metrics for Cryptosystems with Masking Countermeasure -- 2.1 Notations and Existing First-Order Metrics -- 2.2 Our Proposed Information Leakage Metric -- 2.3 Analysis of the Metrics Under Boolean Masking -- 3 Relating `39`42`"613A``45`47`"603AILA to DPA and CPA Success Rates -- 3.1 First-Order Power Analysis Attack Model -- 3.2 Second-Order Power Analysis Attack Model -- 3.3 Approximation Errors in the Simple Success Rate Formulas -- 3.4 Comparing Effectiveness of the First-Order Attack and the Second-Order Attack -- 3.5 Extension to Higher-Order Power Analysis Attack Model -- 4 Numerical Results -- 4.1 Numerical Comparison of Metrics Versus Success Rates.
4.2 Experimental Results on Physical Implementations.
Record Nr. UNISA-996466189403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in Cryptology – ASIACRYPT 2015 : 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 -- December 3, 2015, Proceedings, Part II / / edited by Tetsu Iwata, Jung Hee Cheon
Advances in Cryptology – ASIACRYPT 2015 : 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 -- December 3, 2015, Proceedings, Part II / / edited by Tetsu Iwata, Jung Hee Cheon
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XXV, 802 p. 124 illus.)
Disciplina 005.82
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer security
Coding theory
Information theory
Management information systems
Computer science
Computers
Computer science—Mathematics
Cryptology
Systems and Data Security
Coding and Information Theory
Management of Computing and Information Systems
Theory of Computation
Mathematics of Computing
ISBN 3-662-48800-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- ASIACRYPT 2015 -- Invited Talks -- Structure-Preserving Cryptography -- Computer-Aided Cryptography: Status and Perspectives -- The Moral Character of Cryptographic Work -- Contents - Part II -- Contents - Part I -- Attacks on ASASA -- Key-Recovery Attacks on ASASA -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Structure of the Article -- 1.3 Implementation and Full Version -- 2 Notation and Preliminaries -- 3 Description of ASASA schemes -- 3.1 Presentation and Notations -- 3.2 Description of the Black-Box Scheme -- 3.3 Description of the White-Box Scheme -- 3.4 Description of the -based Public-Key Scheme -- 4 Structural Attack on Black-Box ASASA -- 4.1 Attack Overview -- 4.2 Description of the Attack -- 5 Attacks on the -based Public-Key Scheme -- 5.1 Algebraic Attack on the Scheme -- 5.2 LPN-based attack on the scheme -- 5.3 Peeling Off the Remaining ASAS layers -- 6 A Practical Attack on White-Box ASASA -- 6.1 Attack Overview -- 7 Conclusion -- References -- Number Field Sieve -- The Tower Number Field Sieve -- 1 Introduction -- 2 Overview of TNFS -- 3 Detailed Description and Analysis -- 3.1 Polynomial Selection -- 3.2 Relation Collection -- 3.3 Writing and Solving Linear Equations -- 3.4 Overall Complexity of the Main Phase -- 3.5 Individual Logarithms -- 4 Variants -- 5 Comparison for Cryptographically Relevant Sizes -- 5.1 The Case of General Primes -- 5.2 The Case of Primes of Special Shape (SNFS) -- 6 Cryptographic Consequences -- 7 Appendix: Technicalities -- 7.1 Special-q Sieving -- 7.2 Using a Cyclotomic Field for Q() -- 7.3 The Waterloo Improvement -- References -- Hashes and MACs -- On the Impact of Known-Key Attacks on Hash Functions -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Outline -- 2 Weak Cipher Model -- 2.1 Security Model -- 2.2 Random Weak Cipher -- 2.3 Random Abortable Weak Cipher.
3 Modeling Known-Key Attacks -- 4 Application to PGV Compression Functions -- 4.1 Collision Security -- 4.2 Preimage Security -- 5 Application to Grøstl Compression Function -- 5.1 Collision Security -- 5.2 Preimage Security -- 6 Application to Shrimpton-Stam Compression Function -- 6.1 Collision Security -- 6.2 Preimage Security -- 7 Conclusions -- A Proof of Theorem 2 -- References -- Generic Security of NMAC and HMAC with Input Whitening -- 1 Introduction -- 2 Preliminaries -- 3 The Whitened NMAC Construction -- 3.1 Basic Notation, Message Trees and Repetition Patterns -- 3.2 Interactions and Transcripts -- 3.3 The H-Coefficient Method -- 3.4 Good and Bad Transcripts -- 3.5 Probability of a C-f-collision -- 3.6 Probability of Repeated Outer Invocations -- 3.7 Good Transcripts and Putting Pieces Together -- 3.8 Tightness -- 3.9 Distinguishing-H Security of WNMAC -- 3.10 State Recovery for WNMAC -- 4 Whitening HMAC -- 5 The Dual WNMAC Construction -- References -- Symmetric Encryption -- On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes -- 1 Introduction -- 1.1 Brief Literature Survey -- 1.2 Our Contribution -- 2 Preliminaries -- 2.1 Useful Properties of Matrices -- 2.2 Security Definitions and Notation -- 2.3 Tools for Proving Security -- 3 Linear Mode -- 3.1 Linear Query and Mode -- 3.2 Keyed Constructions Based on Linear Mode -- 4 PRP and SPRP Distinguishing Attacks -- 4.1 PRP Distinguishing Attack on E with = 2a-2 -- 4.2 SPRP Distinguishing Attack on E with = 2a-1 -- 5 Security Analysis of Inverse-Free Single Key Construction -- 5.1 PRP Attack of Single-Key Inverse-Free Constructions Without Masking -- 5.2 PRP Security of Single-Key Luby-Rackoff with Masking -- 6 Conclusion -- References -- Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing -- 1 Introduction.
2 Preliminaries -- 2.1 Notation and General Definitions -- 2.2 Security Definitions -- 2.3 The H-Coefficients Technique -- 2.4 An Extended Sum-Capture Lemma -- 3 Beyond-Birthday-Bound Security -- 3.1 Statement of the Result and Discussion -- 3.2 Definition and Probability of Bad Transcripts -- 3.3 Analysis of Good Transcripts -- References -- An Inverse-Free Single-Keyed Tweakable Enciphering Scheme -- 1 Introduction -- 1.1 Our Contribution -- 2 Preliminaries -- 2.1 Tweakable Encryption Schemes -- 2.2 Pseudorandomness and Distinguishing Games -- 2.3 Domain Extensions and Coefficient H Technique -- 3 The FMix Construction -- 4 TSPRP Security Analysis of FMix -- 4.1 Good Views and Interpolation -- 4.2 Extension of FMix for Partial Block Input -- 5 Proof of Proposition 1 -- 5.1 Simulations -- 5.2 Admissibility -- 5.3 Basis and Extension -- 5.4 Extension Equations -- 5.5 Bringing It All Together -- 5.6 Proof of Lemma 1 -- 6 Conclusion and Future Works -- References -- Foundations -- On Black-Box Complexity of Universally Composable Security in the CRS Model -- 1 Introduction -- 1.1 Our Results -- 2 Preliminaries -- 2.1 Oblivious Transfer -- 2.2 UC Commitment Schemes -- 2.3 Extractable Commitments -- 3 Static UC Secure Computation -- 3.1 Static UC Oblivious Transfer -- 4 One-Sided Adaptive UC Secure Computation -- 5 Adaptive UC Secure Computation -- 5.1 UC Commitments from PKE with Oblivious Ciphertext Generation -- References -- Public Verifiability in the Covert Model (Almost) for Free -- 1 Introduction -- 1.1 Our Contribution -- 2 Preliminaries -- 2.1 Publicly Verifiable Covert Security -- 2.2 Signed Oblivious Transfer -- 3 Signed Oblivious Transfer Extension -- 3.1 Intuition for the Construction -- 3.2 Towards a Proof of Security -- 3.3 An EU-CMPRA Signature Scheme -- 3.4 Proof of Security -- 4 Our Complete PVC Protocol -- 5 Comparison with Prior Work.
References -- Limits of Extractability Assumptions with Distributional Auxiliary Input -- 1 Introduction -- 1.1 Proof Techniques -- 1.2 Removing Auxiliary Input in diO -- 1.3 Other Applications of the ``Succinct Punctured Program'' Technique -- 1.4 Overview of Paper -- 2 Preliminaries -- 2.1 Public-Coin Differing-Inputs Obfuscation -- 2.2 Extractable One-Way Functions -- 2.3 Succinct Non-Interactive Arguments of Knowledge (SNARKs) -- 2.4 Puncturable PRFs -- 3 Public-Coin Differing-Inputs Obfuscation or Extractable One-Way Functions -- 3.1 From PC-diO to Impossibility of Z-Auxiliary-Input EOWF -- 3.2 PC-diO or SNARKs -- References -- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions -- 1 Introduction -- 2 Definitions of Unlinkable Redactable Signatures -- 2.1 Property-Based Definitions for Unlinkable Redactable Signatures -- 2.2 Ideal Functionality for Unlinkable Redactable Signatures -- 2.3 Key Registration and UC Realizability -- 3 The Construction of Our Redactable Signature Scheme -- 3.1 Vector Commitments Simplified -- 3.2 Non-interactive Zero-Knowledge and Witness Indistinguishable Proof Systems -- 3.3 Our Redactable Signature Scheme -- 4 From Unlinkable Redactable Signatures to Anonymous Credentials -- 4.1 Algorithms of Our Anonymous Credential System -- 4.2 Ideal Functionality for Credentials -- 4.3 Instantiation and Efficiency Analysis -- References -- Side-Channel Attacks -- ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When? -- 1 Introduction -- 2 Background -- 2.1 Measurement Setup -- 2.2 Information Detection Tools -- 2.3 Gaussian Templates Attacks -- 2.4 Key Enumeration and Rank Estimation -- 2.5 Algebraic Side-Channel Attacks -- 2.6 Soft Analytical Side-Channel Attacks -- 3 Comparison with ASCA -- 3.1 Our Representation for SASCA -- 3.2 Comparison Setup.
3.3 Experimental Results -- 4 SASCA Against a Concrete AES Implementation -- 4.1 Profiling Step -- 4.2 Experimental Results -- 5 Comparison with DPA and Enumeration -- 5.1 Evaluation of Profiled Template Attacks -- 5.2 Comparing SASCA and DPA with Enumeration -- 6 Conclusion and Open Problems -- References -- Counting Keys in Parallel After a Side Channel Attack -- 1 Introduction -- 1.1 Evaluating Resistance Against Differential Power Analysis -- 1.2 Problem Statement and Notation -- 1.3 Outline and Our Contributions -- 1.4 Previous Work -- 2 Casting the Key Enumeration as a Knapsack -- 3 An Accurate Key Rank Algorithm -- 3.1 Key Rank Graph -- 3.2 Counting Valid Paths -- 4 Parallelisable Key Enumeration Algorithm -- 4.1 Time Complexity -- 4.2 Memory Efficiency -- 4.3 Parallelisation -- 5 Practical Evaluation and Comparison with Previous Work -- 5.1 Evaluating and Comparing Precision -- 5.2 Evaluating and Comparing Run Times for Key Rank -- 5.3 Evaluating and Comparing Run Times for Key Enumeration -- A Computing Environment -- References -- A Unified Metric for Quantifying Information Leakage of Cryptographic Devices Under Power Analysis Attacks -- 1 Introduction -- 2 Leakage Metrics for Cryptosystems with Masking Countermeasure -- 2.1 Notations and Existing First-Order Metrics -- 2.2 Our Proposed Information Leakage Metric -- 2.3 Analysis of the Metrics Under Boolean Masking -- 3 Relating `39`42`"613A``45`47`"603AILA to DPA and CPA Success Rates -- 3.1 First-Order Power Analysis Attack Model -- 3.2 Second-Order Power Analysis Attack Model -- 3.3 Approximation Errors in the Simple Success Rate Formulas -- 3.4 Comparing Effectiveness of the First-Order Attack and the Second-Order Attack -- 3.5 Extension to Higher-Order Power Analysis Attack Model -- 4 Numerical Results -- 4.1 Numerical Comparison of Metrics Versus Success Rates.
4.2 Experimental Results on Physical Implementations.
Record Nr. UNINA-9910484739403321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in Information and Computer Security [[electronic resource] ] : 6th International Workshop on Security, IWSEC 2011, Tokyo, Japan, November 8-10, 2011. Proceedings / / edited by Tetsu Iwata, Masakatsu Nishigaki
Advances in Information and Computer Security [[electronic resource] ] : 6th International Workshop on Security, IWSEC 2011, Tokyo, Japan, November 8-10, 2011. Proceedings / / edited by Tetsu Iwata, Masakatsu Nishigaki
Edizione [1st ed. 2011.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Descrizione fisica 1 online resource (XII, 231 p.)
Disciplina 005.8
Collana Security and Cryptology
Soggetto topico Computer security
Management information systems
Computer science
Data encryption (Computer science)
Computers and civilization
Computer communication systems
Algorithms
Systems and Data Security
Management of Computing and Information Systems
Cryptology
Computers and Society
Computer Communication Networks
Algorithm Analysis and Problem Complexity
ISBN 3-642-25141-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996465696903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Fast Software Encryption [[electronic resource] ] : 17th International Workshop, FSE 2010, Seoul, Korea, February 7-10, 2010 Revised Selected Papers / / edited by Seokhie Hong, Tetsu Iwata
Fast Software Encryption [[electronic resource] ] : 17th International Workshop, FSE 2010, Seoul, Korea, February 7-10, 2010 Revised Selected Papers / / edited by Seokhie Hong, Tetsu Iwata
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (XI, 385 p. 71 illus.)
Disciplina 005.8/2
Collana Security and Cryptology
Soggetto topico Data encryption (Computer science)
Computer communication systems
User interfaces (Computer systems)
Algorithms
Management information systems
Computer science
Computer security
Cryptology
Computer Communication Networks
User Interfaces and Human Computer Interaction
Algorithm Analysis and Problem Complexity
Management of Computing and Information Systems
Systems and Data Security
ISBN 1-280-38745-9
9786613565372
3-642-13858-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Stream Ciphers and Block Ciphers -- Cryptanalysis of the DECT Standard Cipher -- Improving the Generalized Feistel -- Nonlinear Equivalence of Stream Ciphers -- RFID and Implementations -- Lightweight Privacy Preserving Authentication for RFID Using a Stream Cipher -- Fast Software AES Encryption -- Hash Functions I -- Attacking the Knudsen-Preneel Compression Functions -- Finding Preimages of Tiger Up to 23 Steps -- Cryptanalysis of ESSENCE -- Theory -- Domain Extension for Enhanced Target Collision-Resistant Hash Functions -- Security Analysis of the Mode of JH Hash Function -- Enhanced Security Notions for Dedicated-Key Hash Functions: Definitions and Relationships -- Message Authentication Codes -- A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs -- How to Thwart Birthday Attacks against MACs via Small Randomness -- Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited -- Hash Functions II -- Higher Order Differential Attack on Step-Reduced Variants of Luffa v1 -- Rebound Attack on Reduced-Round Versions of JH -- Hash Functions III (Short Presentation) -- Pseudo-cryptanalysis of the Original Blue Midnight Wish -- Differential and Invertibility Properties of BLAKE -- Cryptanalysis -- Rotational Cryptanalysis of ARX -- Another Look at Complementation Properties -- Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations.
Record Nr. UNISA-996465849303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui