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.

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: TextTextSeries: SerienbezeichnungLecture notes in computer science: 9452.; LNCS sublibrary: Publisher: Berlin, Heidelberg : Springer, 2015Description: 1 online resource (xxv, 810 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783662487976; 3662487977; 3662487969; 9783662487969Other title: ASIACRYPT 2015Subject(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.82 LOC classification: QA76.9.A25Online resources: Click here to access online
Contents:
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 Scheme4 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 Definition4 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 Hybrids6 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 Security3.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
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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.

English.

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 Scheme4 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 Definition4 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 Hybrids6 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 Security3.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

There are no comments for this item.

to post a comment.

Powered by Koha