Provable Security Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Baek, Joonsang (Επιμελητής έκδοσης), Bao, Feng (Επιμελητής έκδοσης), Chen, Kefei (Επιμελητής έκδοσης), Lai, Xuejia (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
• Σειρά: Lecture Notes in Computer Science, 5324
• Θέματα: Computer science.; Computer security.; Data encryption (Computer science).; Coding theory.; Computers.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Data Encryption.; Mathematics of Computing.; Systems and Data Security.; Coding and Information Theory.; Theory of Computation.; Mathematical Logic and Formal Languages.

This book constitutes the refereed proceedings of the Second International Conference on Provable Security, ProvSec 2008, held in Shanghai, China, October 30 - November 1, 2008. The 25 revised full papers presented were carefully reviewed and selected from 79 submissions. The papers are organized in...

Πίνακας περιεχομένων:

• Encryption
• Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
• Tweakable Pseudorandom Permutation from Generalized Feistel Structure
• Timed-Release Encryption Revisited
• Efficient and Provably Secure Certificateless Multi-receiver Signcryption
• A CCA Secure Hybrid Damgård’s ElGamal Encryption
• Signature
• Construction of Yet Another Forward Secure Signature Scheme Using Bilinear Maps
• Optimal Online/Offline Signature: How to Sign a Message without Online Computation
• Round-Optimal Blind Signatures from Waters Signatures
• Secure Proxy Multi-signature Scheme in the Standard Model
• Server-Aided Verification Signatures: Definitions and New Constructions
• Analysis
• On Proofs of Security for DAA Schemes
• Cryptanalysis of Vo-Kim Forward Secure Signature in ICISC 2005
• Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
• On the Equivalence of Generic Group Models
• The Analysis of an Efficient and Provably Secure ID-Based Threshold Signcryption Scheme and Its Secure Version
• Application of Hash Functions
• Leaky Random Oracle (Extended Abstract)
• How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
• Universal Composability
• Relationship of Three Cryptographic Channels in the UC Framework
• A Universally Composable Framework for the Analysis of Browser-Based Security Protocols
• Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
• Universally Composable Security Analysis of TLS
• Round Optimal Universally Composable Oblivious Transfer Protocols
• Applications
• A Tamper-Evident Voting Machine Resistant to Covert Channels
• Self-healing Key Distribution with Revocation and Resistance to the Collusion Attack in Wireless Sensor Networks.