Information Security and Privacy

Name: Information Security and Privacy | 16th Australisian Conference, ACISP 2011, Melbourne, Australia, July 11-13, 2011, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

16th Australisian Conference, ACISP 2011, Melbourne, Australia, July 11-13, 2011, Proceedings

Udaya Parampalli Philip Hawkes(Herausgeber*in)

Springer (Verlag)

Erschienen am 1. Juli 2011

XIII, 464 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-22497-3 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Table of Contents
Invited Talks
On Known and New Differentially Uniform Functions
Introduction
The Know AB, APN and Differentially 4-Uniform Functions and Their Respective Drawbacks
AB and APN Functions
A Way of Constructing Differentially Uniform Permutations
Reference
Symmetric Key Cryptography
New Impossible Differential Attacks of Reduced-Round Camellia-192 and Camellia-256
Introduction
Preliminaries
Notations
The Camellia Algorithm
Properties and 6-Round Impossible Differentials of Camellia with FL/FL-1 Functions
Impossible Differential Attacks on Camellia with FL/FL-1 Functions and Whitening
Impossible Differential Attack on 11-Round Camellia-256
Impossible Differential Attack on 10-Round Camellia-192
Impossible Differential Cryptanalysis of 15-Round Camellia-256 without FL/FL-1 Layers and Whitening
Conclusion
References
Results on the Immunity of Boolean Functions against Probabilistic Algebraic Attacks
Introduction
Preliminary
Probabilistic Algebraic Attacks
Time Complexity
Data Complexity
Validity
Algebraic Immunity Distance
Bounds on Algebraic Immunity Distance
k-Error Algebraic Immunity
Conclusion
References
Finding More Boolean Functions with Maximum Algebraic Immunity Based on Univariate Polynomial Representation
Introduction
Preliminaries
Deciding Boolean Functions Having Maximum AI under Univariate Polynomial Representation
Finding MAI Boolean Functions under Univariate Polynomial Representation
Analysis of Algebraic Degree and Nonlinearity
Conclusion
References
Improving the Algorithm 2 in Multidimensional Linear Cryptanalysis
Introduction
Notations and Background
Algorithm 2 of Multidimensional Linear Cryptanalysis
Construction of Multidimensional Probability Distribution
Brief Analysis on Algorithm 2 of the Full Biryukov's Model and Hermelin's Model
Efficient Computation of Distillation Phase of Extended Algorithm 2 of Matsui
Case 1 and Method 1
Case 2 and Method 2
Results on Cryptanalysis of Serpent
Experimental Results on 5-Round Serpent
Cryptanalysis of 11-Round and 12-Round Reduced Serpent
Conclusion
References
State Convergence in the Initialisation of Stream Ciphers
Introduction
Background and Notation
Case Studies
A5/1 Stream Cipher
Mixer
Discussion
Conclusion
References
On Maximum Differential Probability of Generalized Feistel
Introduction
Preliminaries
Type-2 GFS and Its Generalization
Maximum Differential Probability
MDP Bounding Algorithm
Overview
Ordered Sum
Details of Bounding Algorithm
Optimized Version
Experimental Results
Results for Type-2
Results for Type-2i
Conclusion
References
Double SP-Functions: Enhanced Generalized Feistel Networks
Introduction
Background
Contributions and Outline
Equivalence of Differential and Linear Truncated Trails
Truncated Differential Trails and Constraints
Truncated Linear Trails and Constraints
Active Functions and Equivalence for Type-I GFNs
Active Functions and Equivalence for Type-II GFNs
Bounds for Active Functions
Some Truncated Differential Trails
Differentially Active Functions of Type-I GFNs
Differentially Active Functions in Type-II GFNs
Comparative Efficiency of GFNs
Converting Active Functions to Active S-Boxes
GFNs: Double SP-Functions vs Single SP-Functions
Conclusions
References
Algebraic Techniques in Differential Cryptanalysis Revisited
Introduction
Description of Albrecht's Differential-Algebraic Attack
Inapplicability of Albrecht et al.'s Attacks
Inapplicability of Attack C
Inapplicability of Attack B to PRESENT
New Differential-Algebraic Attacks
Attack 1 for the PRESENT Block Cipher
Attack 2 for the PRESENT Block Cipher
Conclusion
References
Hash Functions
Faster and Smoother - VSH Revisited
Introduction
Very Smooth Hash Algorithm
Security
A Variant without Modular Squaring
The k-Sum Problem and the Tree Algorithm
Security of Faster VSH
A Variant without Modular Reduction
Experimental Results
Choice of the List Elements
Minimal Distance of Colliding Inputs
On Provable Security
Conclusions
References
Cryptanalysis of the Compression Function ofSIMD
Introduction
Notations and Description of SIMD
Notations
Description of SIMD
The Free-Start Near Collision Attack on the Reduced SIMD-256
Constructing the Specific Differential Path for 20-Step SIMD-256
Message/IV Modification
Free-Start Near Collision and Distinguishing Attack on SIMD-512
Free-Start Near Collision Attack for the Compression Function of 24-Step SIMD-512
A Differential Distinguisher for the Compression Function of Full SIMD-512
Conclusions
References
Protocols
Electronic Cash with Anonymous User Suspension
Introduction
Preliminaries
Security Definition
Syntax
Security Requirements
Our System
High Level Description
Construction Details
Efficiency Analysis
Discussions
Incorporating Tracing Authority and Open Authority
Managing the Size of SUL and the Bank's Database
Conclusion
References
T-Robust Scalable Group Key Exchange Protocol with O(log n) Complexity
Introduction
Preliminary
The Security Assumptions, and Model of GKE
Notation and Assumptions on GKE
Background
Robust GKE with O(log n) complexity
Intuition
Cross-Help GKE (CH-GKE)
Generalized CH-GKE
Security of CH-GKE
T-Robust GKE with O(log n) Complexity
Comparison
Conclusions
References
Application-Binding Protocol in the User Centric Smart Card Ownership Model
Introduction
Application Sharing Mechanism
Smart Card Firewall Mechanism
User Centric Smart Card Firewall
Applications-Binding Protocol (ABP)
Application-Binding
Threat Model
Requirements for the Protocol
Enrolment Process
Proposed Application-Binding Protocol
Proposed Protocol Analysis
Analytical Analysis
Protocol Verification by CasperFDR
Practical Implementation
Conclusion and Future Research Direction
Acknowledgements
References
Access Control and Security
Security in Depth through Smart Space Cascades
Introduction
Related Work
Access Control for Smart Space Cascades
Background: ISO/IEC 10181-3
Targets in Practice
Dependent Targets
Access Control Enforcement Functions
Access Control Decision Functions
Smart Space Interactions
Decentralised Requests
Negotiating Positive Outcomes
Smart Space Sign on
Protective Layer Analysis
Applying the Method
Conclusion
References
GeoEnc: Geometric Area Based Keys andPolicies in Functional Encryption Systems
Introduction
Our Results
Related Work
Organization
Preliminaries and Blocks
Geometric Polygon
Bilinear Maps in Composite Order Group
Complexity Assumptions
Framework of GeoEnc Scheme
GeoEncLine Scheme
Syntax of GeoEncLine
Security Model of GeoEncLine
Construction of GeoEncLine
Correctness and Consistency
Security Analysis
Practical Coordination Evaluation
Extension to GeoEncHull Scheme
Concluding Remarks
References
An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem
Introduction
Preliminaries
Our Results
Comparison to Fuchsbauer et al.'s Scheme
Definitions and Background
Secret Sharing
Notions of Game-Theoretic Equilibria
Assumptions on the Utility Functions
Our Protocol for t-out-of-n Rational Secret Sharing
Initial Share Phase
Secret Reconstruction Phase
Security of our Rational SSS
Conclusion
References
DMIPS - Defensive Mechanism against IP Spoofing
Introduction
Related Work
DMIPS Scheme
Inside the AS
Outside the AS
Attack Scenario
Inside the AS
Outside the AS
Evaluation
Inside the AS
Outside the AS
Conclusion
References
Public Key Cryptography
Provably Secure Key Assignment Schemes from Factoring
Introduction
Our Contributions
Organization
Preliminaries
Factoring Assumption
Key Assignment Schemes
A Basic Scheme
The FP Scheme
The FP Scheme for a Single Chain
The FP Scheme for General Posets
A Scheme with Faster Key Derivation
Efficiency Considerations
Concluding Remarks
References
Efficient CCA-Secure CDH Based KEM Balanced between Ciphertext and Key
Introduction
Our Contributions
Preliminaries
Key Encapsulation Mechanisms
Diffie-Hellman Assumptions
Goldreich-Levin Hardcore Function
The New Scheme
Security Proof
Efficiency Analysis
Conclusion
References
Generic Construction of Strongly Secure Timed-Release Public-Key Encryption
Introduction
Background
Our Contributions
Definitions
Components
Timed-Release Public-Key Encryption
IND-CTCA Security
IND-SCCA-TS Security
Construction of Timed-Release Public-Key Encryption
IBE-then-PKE Construction
IND-CTCA Security
IND-SCCA-TS Security
Conclusion
References
Identity-Based Server-Aided Decryption
Introduction
Related Works
Contribution
Definitions
Pairings and Related Intractability Assumption
Building Blocks
Framework of ID-Based Server-Aided Decryption
Security of ID-Based Server-Aided Decryption
CCA-Secure ID-Based Server-Aided Decryption scheme from Gentry's IBE
Construction
Security Analysis
CCA-Secure ID-Based Server-Aided Decryption scheme from Boneh-Franklin's IBE
Construction
Security Analysis
Comparison
Conclusion
References
A Generic Variant of NIST's KAS2 Key Agreement Protocol
Introduction
A Generic Protocol
Security Model
The RSA Setting
Comparisons
Security Argument
The Discrete Log Setting
Comparisons
Security Argument
Miscellaneous Notes
Hybrid Protocol
KAS1
Key Reusage
References
A Single Key Pair is Adequate for the Zheng Signcryption
Introduction
Overview of the Zheng Signcryption Scheme
Security Model
Syntax of Signcryption
Definition of Confidentiality
Definition of Unforgeability
Assumptions and Primitives
Problems and Assumptions
One-Time Symmetric Key Encryption
One-Way Hash Functions
Security Proofs
Proof of Unforgeability
Proof of Confidentiality
Relationships with Proofs by Baek, Steinfeld and Zheng
References
Towards Public Key Encryption Scheme Supporting Equality Test with Fine-Grained Authorization
Introduction
Related Work
Our Contribution
Organization
Formulation of FG-PKEET
Description of FG-PKEET
The Security Model
OW-CCA Security against a Type-I Adversary
Fine-Grained Authorization Property
IND-CCA Security against a Type-II Adversary
A New FG-PKEET Cryptosystem
The Public Key Encryption Scheme
The Token Generation Algorithm
The Equality Test Algorithm
Comprehensive Security Analysis
Preliminary
Proof Results
Potential Vulnerability and Enhancement
Conclusion
References
Posters
Lattice-Based Completely Non-malleable PKE in the Standard Model (Poster)
Introduction
Contributions of the Paper
Background and Definitions
A Construction Based on LWE Problem
Correctness and Security
Conclusion and Open Problems
References
Compliance or Security, What Cost? (Poster)
Introduction
Misaligned Incentives: Audit and the Failure to Determine Risk
Patching and Validation
Conclusion
References
Preimage Attacks on Full-ARIRANG (Poster)
Introduction
Description of ARIRANG
Preimage Attacks on Full ARIRANG-256/-512
Chunk Separation
Preimage Attacks on ARIRANG-256
Preimage Attacks on ARIRANG-512
Concluding Remarks
References
Finding Collisions for Reduced Luffa-256 v2 (Poster)
Introduction
Specification of Luffa-256 v2
Chaining and Round Function
Non-linear Permutation
The Collision Attack on 4-Step Luffa-256 v2
The Differential Path
Message Modification
Conclusion
References
Improved Security Analysis of Fugue-256 (Poster)
Fugue-256 Hash Function
Integral Distinguisher for 16.5 Rounds of G
Improved Meet-in-the-Middle Preimage Attack on F-256
Concluding Remarks
References
Improved Meet-in-the-Middle Cryptanalysis ofKTANTAN (Poster)
Introduction
Developments in MITM Attacks
Meet-in-the-Middle Cryptanalysis of KTANTAN
The Previous Meet-in-the-Middle Attack
New Experimental Observations on the Attack
Low Complexity Implementation of the Attack
More General MITM Attacks on KTANTAN Family
The Observations and Search
The Attack with Splice-and-Cut and Indirect-Partial-Matching
Conclusions
References
Toward Dynamic Attribute-Based Signcryption (Poster)
Introduction
Attribute-Based Signcryption (ABSC)
Encrypted Storage System
Our Approach: Dynamic ABSC
System Operations of DABSC
Conclusion and toward the Concrete Construction of DABSC Scheme
References
A Verifiable Distributed Oblivious Transfer Protocol
Introduction
Background
Distributed Oblivious Transfer Protocol
Verifiable Secret Sharing Scheme
Error-correcting Code Decoding Scheme
Our Model
Communication Model
Adversary Model
Proposed Protocol
Security of the Protocol
References
Impracticality of Efficient PVSS in Real Life Security Standard (Poster)
Introduction
Specification of an Important Proof in the Two PVSS Schemes
RSA Key in Real-Life Cryptographic Protocols
Intolerable Cost of the General Specification, Making the PVSS Scheme Impractical in Real Life
Conclusion
References
Electromagnetic Analysis Enhancement with Signal Processing Techniques (Poster)
Introduction
Preliminaries
EMA with Signal Processing
Conclusions
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken