Description 
1 online resource (xiv, 572 pages) : illustrations 
Series 
Lecture notes in computer science, 03029743 ; 5350 

LNCS sublibrary: SL 4  Security and cryptology 

Lecture notes in computer science ; 5350.


LNCS sublibrary. SL 4, Security and cryptology.

Contents 
MultiParty Computation  MPC vs. SFE : Unconditional and Computational Security  Strongly Multiplicative and 3Multiplicative Linear Secret Sharing Schemes  Graph Design for Secure Multiparty Computation over NonAbelian Groups  Invited Talk  Some Perspectives on ComplexityBased Cryptography  Cryptographic Protocols I  A Modular Security Analysis of the TLS Handshake Protocol  Ambiguous Optimistic Fair Exchange  Compact Proofs of Retrievability  On the Security of HB# against a ManintheMiddle Attack  Cryptographic Hash Functions I  Hash Functions from Sigma Protocols and Improvements to VSH  Slide Attacks on a Class of Hash Functions  Basing PRFs on ConstantQuery Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography  Cryptographic Protocols II  Universally Composable Adaptive Oblivious Transfer  A LinkedList Approach to Cryptographically Secure Elections Using Instant Runoff Voting  Towards Robust Computation on Encrypted Data  Efficient Protocols for Set Membership and Range Proofs  Cryptographic Hash Functions II  Preimage Attacks on 3, 4, and 5Pass HAVAL  How to Fill Up MerkleDamgård Hash Functions  Limits of Constructive Security Proofs  PublicKey Cryptography I  Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational DiffieHellman Assumption  Twisted Edwards Curves Revisited  On the Validity of the?Hiding Assumption in Cryptographic Protocols  Chosen Ciphertext Security with Optimal Ciphertext Overhead  LatticeBased Cryptography  Concurrently Secure Identification Schemes Based on the WorstCase Hardness of Lattice Problems  Rigorous and Efficient Short Lattice Vectors Enumeration  Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits  PrivateKey Cryptography  An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity  An Improved Impossible Differential Attack on MISTY1  PublicKey Cryptography II  Generalized Identity Based and Broadcast Encryption Schemes  Speeding Up the Pollard Rho Method on Prime Fields  Sufficient Conditions for Intractability over BlackBox Groups: Generic Lower Bounds for Generalized DL and DH Problems  OAEP Is Secure under KeyDependent Messages  Analysis of Stream Ciphers  Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks  A New Attack on the LEX Stream Cipher  Breaking the FFCSRH Stream Cipher in Real Time 
Summary 
This book constitutes the refereed proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2008, held in Melbourne, Australia, in December 2008. The 33 revised full papers presented together with the abstract of 1 invited lecture were carefully reviewed and selected from 208 submissions. The papers are organized in topical sections on mulitiparty computation, cryptographic protocols, cryptographic hash functions, publickey cryptograhy, latticebased cryptography, privatekey cryptograhy, and analysis of stream ciphers 
Notes 
International conference proceedings 
Bibliography 
Includes bibliographical references and index 
Notes 
Print version record 
Subject 
Data encryption (Computer science)  Congresses


Computer security  Congresses


Informatique.


Computer security.


Data encryption (Computer science)

Genre/Form 
Conference papers and proceedings.


Conference papers and proceedings.


Actes de congrès.

Form 
Electronic book

Author 
Pieprzyk, Josef, 1949

LC no. 
2008939141 
ISBN 
9783540892557 

3540892559 
