
Foundations and Practice of Security
Beschreibung
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
This book constitutes the carefully refereed and revised selected papers of the 4th Canada-France MITACS Workshop on Foundations and Practice of Security, FPS 2011, held in Paris, France, in May 2011. The book contains a revised version of 10 full papers, accompanied by 3 keynote addresses, 2 short papers, and 5 ongoing research reports. The papers were carefully reviewed and selected from 30 submissions. The topics covered are pervasive security and threshold cryptography; encryption, cryptanalysis and automatic verification; and formal methods in network security.
Weitere Details
Weitere Ausgaben
Andere Ausgaben

Personen
Inhalt
- Title
- Organization
- Table of Contents
- Keynote Address
- Preserving Privacy in Online Social Networks
- Introduction
- Privacy in OSN
- Privacy Setting: Facebook Case
- Data Privacy Laws
- Privacy Requirements in OSN
- Privacy Solutions
- FlyByNight flybynight
- FaceCloak facecloak
- NOYB noyb
- Persona persona
- Lockr lockr:2008,lockr:2009
- BE-Based Scheme sun:infocom10
- GCC gcc:2010
- EASiER easier
- IBBE-Based Scheme raji
- Conclusions
- References
- Short Papers
- TTP SmartCard-Based ElGamal Cryptosystem Using Threshold Scheme for Electronic Elections
- Introduction
- Contributions and Organization
- Smartcard Protocol
- Electoral Board Constitution
- Vote Encryption and Tallying Votes
- Implementation Details
- JavaCard-Based ElGamal and Threshold Scheme Rationale
- Big Number Library
- ElGamal and Threshold Scheme API in JavaCards
- Evaluation
- Conclusions and FutureWork
- References
- Automated Verification of Block Cipher Modes of Operation, an Improved Method
- Introduction
- Definitions
- Semantics
- New Invariants
- Encryption Security
- Hoare Logic Rules
- Example
- Conclusion
- References
- Pervasive Security and Threshold Cryptography
- (SC)2: Secure Communication over Smart Cards How to Secure Off-Card Matching in Security-by-Contract for Open Multi-application Smart Cards
- Introduction
- Contribution of This Paper
- SC for Open Multi-applications Smart Cards
- SC Framework... in a Nutshell
- Problem: Securing Off-Card SC Contract-Policy Matching
- (SC)2: Secure Communication over Smart Cards
- Initialization Phase
- Contract-Policy Matching Phase
- (SC)2 Implementation
- Implementation
- Optimization
- Memory Usage Analysis
- Security Analysis
- Protocol Analysis
- Cryptographic Algorithms and Key-Sizes
- Discussion
- Conclusion
- References
- Private Identification of RFID Tags
- Introduction
- Related Work
- Background
- Coding Theory
- Complexity Assumption
- McEliece Cryptosystem
- Private Identification
- Main Protocol
- Security Analysis
- Resource Requirements
- Conclusions and Future Work
- References
- Threshold Encryption into Multiple Ciphertexts
- Introduction
- Preliminaries
- A Multi-ciphertext Scheme
- Multiple Ciphertext Mode (MCM)
- Basic MCM
- Security of Basic MCM
- MCM Variants
- Efficiency of Encryption and Recovery
- Shorter Tags
- Authentication
- Conclusion
- References
- Encryption, Cryptanalysis and Automatic Verification
- A Novel Commutative Blinding Identity Based Encryption Scheme
- Introduction
- Related Work
- Motivation
- Our Contributions
- Preliminary
- Bilinear Maps
- Bilinear Diffie-Hellman Problem
- Our Scheme
- Security Analysis
- Chosen Ciphertext Security
- Twin Technique and Trapdoor Test
- CCA Construction from the Twin Technique
- Security Analysis
- Further Discussion
- Conclusion
- References
- A Related-Key Attack on Block Ciphers with Weak Recurrent Key Schedules
- Introduction
- Notation
- Considered Block Cipher Family
- Related Work
- The Attack Technique
- Attack on 25-Round Feistel Schemes with the GOST Cipher Key Schedule
- Conclusion
- References
- A Computational Indistinguishability Logic for the Bounded Storage Model
- Introduction
- BSM
- Bounded Storage Model
- Protocol Description
- CIL
- Basic Notions of CIL
- Rules
- Protocol Proved Using CIL
- First Part of the Protocol
- Second Part of the Protocol
- Unifying the Two Parts
- Conclusion
- References
- Keynote Addresses
- Preventing the Cluster Formation Attack against the Hierarchical OLSR Protocol
- Introduction
- Optimized Link State Routing Protocol
- The Hierarchical OLSR Protocol
- Cluster Formation
- Cluster Head Message Exchange
- Topology Control Propagation
- Cluster Formation Attack against the HOLSR Protocol
- Adversary Model
- Handling the Attack with the Use of Hash Chains
- Results and Simulations Setup
- Related Work
- Conclusion
- References
- Secret Key Establishment over Noisy Channels
- Introduction
- SKE with Local Randomness
- SKE without Local Randomness
- Notation
- Paper Structure
- Description of SKE in the 2DMBC Setup
- SKE over 2DMBC with Local Randomness
- SK Capacity: Lower Bound
- SK Capacity: Upper Bound
- Physically Degraded 2DMBC
- SKE over 2DMBC without Local Randomness
- Impossibility Results for Special Cases
- Bounds on the SK Capacity
- The Role of Local Randomness over BSCs
- Concluding Remarks
- References
- Formal Methods and Network Security
- Formal Specification and Validation of Security Policies
- Introduction
- Preliminaries
- Secured Systems
- Security Signature
- Environments and Transition Rules
- Security Systems, Policy Rules and Secured Systems
- Checking Security Properties
- Related Work
- Conclusion and Future Work
- References
- Vote-Independence: A Powerful Privacy Notion for Voting Protocols
- Introduction
- Preliminaries
- The Applied Pi Calculus
- Voting Process
- Privacy
- Vote-Independence
- Vote-Independence (without Collaboration)
- Vote-Independence with Passive Collaboration
- Vote-Independence with Active Collaboration
- Hierarchy and Relation to Privacy
- Hierarchy
- Relation to Privacy
- The Global Picture
- Example: FOO
- Example: Okamoto
- Example: Bingo Voting
- Example: Lee et al.
- Conclusion
- References
- Black-Box Property of Cryptographic Hash Functions
- Introduction
- Preliminaries
- The Black-Box Property
- Merkle-Damgård and the Black-Box Property
- HMAC Is Prf-BB Preserving Domain Extension Transform
- Prf-BB and Pseudo-random Oracle
- Conclusion
- References
- Phishing Detection with Popular Search Engines: Simple and Effective
- Introduction
- Phishing Detection with Popular Search Engines
- Applying Classification Methods
- Linear Discriminant Analysis
- Naïve Bayesian Classification
- K-Nearest Neighbour Classification
- Support Vector Machines
- Experiment Results
- Description of the Dataset
- Classification Results
- Related Work
- Conclusion and Future Work
- References
- Ongoing Research
- A Contextual Privacy-Aware Access Control Model for Network Monitoring Workflows: Work in Progress
- Introduction
- Related Work
- Reference Framework for Network Monitoring
- Policy Model
- Information Model
- Actions, Tasks and Workflows
- Access Control Rules
- Knowledge Extraction
- Conclusions and Current Work
- References
- A Metamodel for the Design of Access-Control Policy Enforcement Managers: Work in Progress
- Introduction
- The PEM Metamodel
- Sequence Diagrams
- Class Diagrams
- Discussion and Conclusion
- References
- Specification and Verification of Access Control Policies in EB3SEC: Work in Progress
- Introduction
- eb3sec
- Verification
- Conclusion and Future Works
- References
- A Metamodel of the B Modeling of Access-Control Policies: Work in Progress
- Introduction
- Combining Static and Dynamic Rules
- A Formal Notation for AC Rules
- A Proposal for AC Modeling Using B
- Combinaison of B Machines
- The Static Filter
- The Dynamic Filter
- Conclusion
- References
- Formal Verification of a Key Establishment Protocol for EPC Gen2 RFID Systems:Work in Progress
- Introduction
- Motivation
- Proposed Key Establishment Protocol
- Assumptions Prior the Verification Process
- The AVISPA Model Checking Tool
- A Brief Presentation
- The HLPSL Format
- Automatic Verification of the Protocol
- Conclusion
- References
- Author Index
Systemvoraussetzungen
Dateiformat: PDF
Kopierschutz: Wasserzeichen-DRM (Digital Rights Management)
Systemvoraussetzungen:
- Computer (Windows; MacOS X; Linux): Verwenden Sie zum Lesen die kostenlose Software Adobe Reader, Adobe Digital Editions oder einen anderen PDF-Viewer Ihrer Wahl (siehe E-Book Hilfe).
- Tablet/Smartphone (Android; iOS): Installieren Sie bereits vor dem Download die kostenlose App Adobe Digital Editions oder die App PocketBook (siehe E-Book Hilfe).
- E-Book-Reader: Bookeen, Kobo, Pocketbook, Sony, Tolino u.v.a.m.
Das Dateiformat PDF zeigt auf jeder Hardware eine Buchseite stets identisch an. Daher ist eine PDF auch für ein komplexes Layout geeignet, wie es bei Lehr- und Fachbüchern verwendet wird (Bilder, Tabellen, Spalten, Fußnoten). Bei kleinen Displays von E-Readern oder Smartphones sind PDF leider eher nervig, weil zu viel Scrollen notwendig ist. Mit Wasserzeichen-DRM wird hier ein „weicher” Kopierschutz verwendet. Daher ist technisch zwar alles möglich – sogar eine unzulässige Weitergabe. Aber an sichtbaren und unsichtbaren Stellen wird der Käufer des E-Books als Wasserzeichen hinterlegt, sodass im Falle eines Missbrauchs die Spur zurückverfolgt werden kann.
Weitere Informationen finden Sie in unserer E-Book Hilfe.