Amazon cover image
Image from Amazon.com

Provable Security : 9th International Conference, ProvSec 2015, Kanazawa, Japan, November 24-26, 2015, Proceedings / edited by Man-Ho Au, Atsuko Miyaji.

By: (9th : ProvSec (Conference) (9th : 2015 : Kanazawa, Japan)Contributor(s): Au, Man-Ho [editor.] | Miyaji, Atsuko, Professor [editor.]Material type: TextTextSeries: Serienbezeichnung | Lecture notes in computer science ; 9451. | LNCS sublibrary. SL 4, Security and cryptology.Publisher: Cham : Springer, 2015Description: 1 online resource (xix, 504 pages) : color illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783319260594; 3319260596Other title: ProvSec 2015Subject(s): Computer security -- Congresses | Data encryption (Computer science) -- Congresses | Data protection -- Congresses | Computer science | Computer security | Data encryption (Computer science) | Application software | Computers and civilization | Management information systems | Computer security | Ethical & social aspects of IT | Public administration | Information architecture | Coding theory & cryptology | Computers -- Security -- General | Computers -- Social Aspects -- General | Computers -- Data Processing | Business & Economics -- Information Management | Application software | Computer science | Computer security | Computers and civilization | Data encryption (Computer science) | Data protection | Management information systemsGenre/Form: Electronic books. | 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 -- Provsec 2015 The 9th International Conference on Provable Security -- Invited Talks -- Advances in Authenticated Encryption -- New Advances in Secure RAM Computation -- On Privacy for RFID -- Contents -- Invited Paper -- On Privacy for RFID -- 1 Introduction -- 2 The V07 Model and the OV12 Extension -- 3 The HPVP11 Model -- 4 Strong Privacy in Distance Bounding -- 5 Conclusion -- References -- Fundamental -- From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Efficiency -- 1.3 Further Related Work
2 Preliminaries -- 2.1 The UC-Framework -- 2.2 Signature Schemes -- 2.3 Commitment Schemes -- 2.4 Resettably-Sound Zero-Knowledge Arguments of Knowledge -- 2.5 Sig-Com Schemes -- 3 Ideal Functionalities -- 4 Compiler -- 4.1 Protocol Using Resettably-Sound Zero-Knowledge -- 4.2 Protocol Using UC-Secure Seed-OTs -- 5 Optimizations -- 6 Implications -- References -- Constrained Verifiable Random Functions from Indistinguishability Obfuscation -- 1 Introduction -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation -- 2.2 Puncturable PRFs -- 2.3 Commitment Schemes 19
3 Constrained Verifiable Random Functions -- 4 Generic Construction of Constrained VRFs -- 5 Conclusion -- References -- An Improved Attack for Recovering Noisy RSA Secret Keys and Its Countermeasure -- 1 Introduction -- 1.1 Background -- 1.2 Our Contributions -- 2 Preliminaries -- 2.1 Notation -- 2.2 HS Algorithm -- Recovering RSA Secret Keys by Using Binary Trees -- -- 2.3 HMM Algorithm and KSI Algorithm -- 2.4 Reviews for Probability Theory and Information Theory -- 3 Improving the KSI Bound by Chernoff -- Hoeffding Bound -- 3.1 The KSI Algorithm
3.2 Improved Bounds for Erasure and Error Case -- 4 Practical Countermeasure Against Secret-Key Extraction Attack -- 4.1 Attack Model -- 4.2 Simple (but Ineffective) Countermeasures -- 4.3 Our Countermeasure -- 4.4 Analyses Against Two Types of Adversaries -- 4.5 Information-Theoretic View of our Countermeasure -- 5 Provable Bound for Asymmetric Errors -- A Hamming Distance Between Two Sequences with Erasures -- B Relation Between the Hoeffding Bound and the Chernoff -- Hoeffding Bound -- C Another Parameter Choices -- C.1 How to Choose Analytically -- C.2 More Extension -- References -- Protocol
Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer -- 1 Introduction -- 2 Preliminaries -- 3 Revisiting the Functionality and Modeling of Communication Channels -- 3.1 Existing Formalizations -- 3.2 What Service Should a Secure Channel Provide? -- 4 Constructing an Augmented Secure Channel via Authenticated Encryption -- 4.1 Assumed Resources -- 4.2 Protocol -- 4.3 The Construction Notion -- 4.4 Proof of the Construction -- 5 The Goal of the TLS 1.3 Record Layer -- 5.1 Formalizing the Goal of TLS Record Payload Protection -- 5.2 Achieving the Goal
Summary: This book constitutes the refereed proceedings of the 9th International Conference on Provable Security, ProvSec 2015, held in Kanazawa, Japan, in November 2015. The 19 full papers and 7 short papers presented together with 3 invited talks were carefully reviewed and selected from 60 submissions. The papers are grouped in topical sections on fundamental, protocol, authenticated encryption and key exchange, encryption and identification, privacy and cloud, leakage-resilient cryptography and lattice cryptography, signature and broadcast encryption.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

This book constitutes the refereed proceedings of the 9th International Conference on Provable Security, ProvSec 2015, held in Kanazawa, Japan, in November 2015. The 19 full papers and 7 short papers presented together with 3 invited talks were carefully reviewed and selected from 60 submissions. The papers are grouped in topical sections on fundamental, protocol, authenticated encryption and key exchange, encryption and identification, privacy and cloud, leakage-resilient cryptography and lattice cryptography, signature and broadcast encryption.

Includes author index.

English.

Intro -- Preface -- Provsec 2015 The 9th International Conference on Provable Security -- Invited Talks -- Advances in Authenticated Encryption -- New Advances in Secure RAM Computation -- On Privacy for RFID -- Contents -- Invited Paper -- On Privacy for RFID -- 1 Introduction -- 2 The V07 Model and the OV12 Extension -- 3 The HPVP11 Model -- 4 Strong Privacy in Distance Bounding -- 5 Conclusion -- References -- Fundamental -- From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Efficiency -- 1.3 Further Related Work

2 Preliminaries -- 2.1 The UC-Framework -- 2.2 Signature Schemes -- 2.3 Commitment Schemes -- 2.4 Resettably-Sound Zero-Knowledge Arguments of Knowledge -- 2.5 Sig-Com Schemes -- 3 Ideal Functionalities -- 4 Compiler -- 4.1 Protocol Using Resettably-Sound Zero-Knowledge -- 4.2 Protocol Using UC-Secure Seed-OTs -- 5 Optimizations -- 6 Implications -- References -- Constrained Verifiable Random Functions from Indistinguishability Obfuscation -- 1 Introduction -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation -- 2.2 Puncturable PRFs -- 2.3 Commitment Schemes 19

3 Constrained Verifiable Random Functions -- 4 Generic Construction of Constrained VRFs -- 5 Conclusion -- References -- An Improved Attack for Recovering Noisy RSA Secret Keys and Its Countermeasure -- 1 Introduction -- 1.1 Background -- 1.2 Our Contributions -- 2 Preliminaries -- 2.1 Notation -- 2.2 HS Algorithm -- Recovering RSA Secret Keys by Using Binary Trees -- -- 2.3 HMM Algorithm and KSI Algorithm -- 2.4 Reviews for Probability Theory and Information Theory -- 3 Improving the KSI Bound by Chernoff -- Hoeffding Bound -- 3.1 The KSI Algorithm

3.2 Improved Bounds for Erasure and Error Case -- 4 Practical Countermeasure Against Secret-Key Extraction Attack -- 4.1 Attack Model -- 4.2 Simple (but Ineffective) Countermeasures -- 4.3 Our Countermeasure -- 4.4 Analyses Against Two Types of Adversaries -- 4.5 Information-Theoretic View of our Countermeasure -- 5 Provable Bound for Asymmetric Errors -- A Hamming Distance Between Two Sequences with Erasures -- B Relation Between the Hoeffding Bound and the Chernoff -- Hoeffding Bound -- C Another Parameter Choices -- C.1 How to Choose Analytically -- C.2 More Extension -- References -- Protocol

Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer -- 1 Introduction -- 2 Preliminaries -- 3 Revisiting the Functionality and Modeling of Communication Channels -- 3.1 Existing Formalizations -- 3.2 What Service Should a Secure Channel Provide? -- 4 Constructing an Augmented Secure Channel via Authenticated Encryption -- 4.1 Assumed Resources -- 4.2 Protocol -- 4.3 The Construction Notion -- 4.4 Proof of the Construction -- 5 The Goal of the TLS 1.3 Record Layer -- 5.1 Formalizing the Goal of TLS Record Payload Protection -- 5.2 Achieving the Goal

Powered by Koha