Cover Image
Read Now

Advances in Cryptology – ASIACRYPT 2005 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings

Bibliographic Details
Other Authors: Roy, Bimal Kumar (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2005, 2005
Edition:1st ed. 2005
Series:Security and Cryptology
Subjects:
Computer Communication Networks
Coding And Information Theory
Coding Theory
Operating Systems
Operating Systems (computers)
Cryptography
Electronic Data Processing / Management
Algorithms
Computer Networks 
Information Theory
Data Encryption (computer Science)
Cryptology
It Operations
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 04308nmm a2200421 u 4500
001 EB000375385
003 EBX01000000000000000228437
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540322672 
100 1 |a Roy, Bimal Kumar  |e [editor] 
245 0 0 |a Advances in Cryptology – ASIACRYPT 2005  |h Elektronische Ressource  |b 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings  |c edited by Bimal Kumar Roy 
250 |a 1st ed. 2005 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2005, 2005 
300 |a XIV, 706 p  |b online resource 
505 0 |a Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application -- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps -- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps -- Key Agreement -- Modular Security Proofs for Key Agreement Protocols -- A Simple Threshold Authenticated Key Exchange from Short Secrets -- Examining Indistinguishability-Based Proof Models for Key Establishment Protocols -- Provable Security -- Server-Aided Verification: Theory and Practice -- Errors in Computational Complexity Proofs for Protocols -- Signatures -- Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature) -- Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs -- Universally Convertible Directed Signatures 
505 0 |a Algebra and Number Theory -- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log -- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? -- Adapting Density Attacks to Low-Weight Knapsacks -- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains -- Multiparty Computation -- Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation -- Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations -- Revealing Additional Information in Two-Party Computations -- Zero Knowledge and Secret Sharing -- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation -- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes -- Updatable Zero-Knowledge Databases -- Information and Quantum Theory -- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification --  
505 0 |a Quantum Anonymous Transmissions -- Privacy and Anonymity -- Privacy-Preserving Graph Algorithms in the Semi-honest Model -- Spreading Alerts Quietly and the Subgroup Escape Problem -- A Sender Verifiable Mix-Net and a New Proof of a Shuffle -- Universally Anonymizable Public-Key Encryption -- Cryptanalytic Techniques -- Fast Computation of Large Distributions and Its Cryptographic Applications -- An Analysis of the XSL Algorithm -- Stream Cipher Cryptanalysis -- New Applications of Time Memory Data Tradeoffs -- Linear Cryptanalysis of the TSC Family of Stream Ciphers -- A Practical Attack on the Fixed RC4 in the WEP Mode -- A Near-Practical Attack Against B Mode of HBB -- Block Ciphers and Hash Functions -- New Improvements of Davies-Murphy Cryptanalysis -- A Related-Key Rectangle Attack on the Full KASUMI -- Some Attacks Against a DoubleLength Hash Proposal -- A Failure-Friendly Design Principle for Hash Functions -- Bilinear Maps --  
653 |a Computer Communication Networks 
653 |a Coding and Information Theory 
653 |a Coding theory 
653 |a Operating Systems 
653 |a Operating systems (Computers) 
653 |a Cryptography 
653 |a Electronic data processing / Management 
653 |a Algorithms 
653 |a Computer networks  
653 |a Information theory 
653 |a Data encryption (Computer science) 
653 |a Cryptology 
653 |a IT Operations 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Security and Cryptology 
028 5 0 |a 10.1007/11593447 
856 4 0 |u https://doi.org/10.1007/11593447?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 003.54 

Similar Items