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.
By: (21st : International Conference on the Theory and Application of Cryptology and Information Security (21st : 2015 : Auckland, N.Z.)
Contributor(s): Iwata, Tetsu [editor.] | Cheon, Jung Hee [editor.]Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 9453.; LNCS sublibrary: Publisher: Heidelberg : Springer, 2015Description: 1 online resource (xxv, 802 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783662488003; 3662488000; 3662487993; 9783662487990Subject(s): Data encryption (Computer science) -- Congresses | Computer science | Computer security | Data encryption (Computer science) | Coding theory | Computers | Computer science -- Mathematics | Management information systems | Coding theory | Computer science | Computer science -- Mathematics | Computer security | Computers | Data encryption (Computer science) | Management information systemsGenre/Form: Electronic books. | Conference papers and proceedings Additional physical formats: Printed edition:: No titleDDC classification: 005.8/2 LOC classification: QA76.9.A25Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
The two-volume set LNCS 9452 and 9453 constitutes the refereed proceedings of the 21st International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2015, held in Auckland, New Zealand, in November/December 2015. The 64 revised full papers and 3 invited talks presented were carefully selected from 251 submissions. They are organized in topical sections on indistinguishability obfuscation; PRFs and hashes; discrete logarithms and number theory; signatures; multiparty computation; public key encryption; ABE and IBE; zero-knowledge; attacks on ASASA; number field sieve; hashes and MACs; symmetric encryption; foundations; side-channel attacks; design of block ciphers; authenticated encryption; symmetric analysis; cryptanalysis; privacy and lattices.
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 ASASA4.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 Logarithms4 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 Functions4.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 Transcripts3.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