1 option
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 / edited by Bimal Kumar Roy.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Security and cryptology ; SL 4, 3788.
- Security and Cryptology ; 3788
- Language:
- English
- Subjects (All):
- Coding theory.
- Information theory.
- Data encryption (Computer science).
- Operating systems (Computers).
- Algorithms.
- Management information systems.
- Computer science.
- Computer networks.
- Coding and Information Theory.
- Cryptology.
- Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Management of Computing and Information Systems.
- Computer Communication Networks.
- Local Subjects:
- Coding and Information Theory.
- Cryptology.
- Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Management of Computing and Information Systems.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XIV, 706 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- Contents:
- 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
- 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 Double Length Hash Proposal
- A Failure-Friendly Design Principle for Hash Functions
- Bilinear Maps
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-32267-2
- 9783540322672
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.