Advances in Cryptology – ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, ProceedingsBimal Kumar Roy |
Contents
| 21 | |
Adapting Density Attacks to LowWeight Knapsacks | 41 |
Efficient and Secure Elliptic Curve Point Multiplication Using | 59 |
Multiparty Computation | 79 |
GraphDecompositionBased Frameworks for SubsetCover Broadcast | 100 |
Revealing Additional Information in TwoParty Computations | 121 |
Zero Knowledge and Secret Sharing | 136 |
Parallel Multiparty Computation from Linear Multisecret Sharing | 156 |
Linear Cryptanalysis of the TSC Family of Stream Ciphers | 373 |
A Practical Attack on the Fixed RC4 in the WEP Mode | 395 |
A NearPractical Attack Against B Mode of | 412 |
Block Ciphers and Hash Functions | 425 |
A RelatedKey Rectangle Attack on the Full KASUMI | 443 |
Some Attacks Against a Double Length Hash Proposal | 462 |
Bilinear Maps | 495 |
Efficient and ProvablySecure IdentityBased Signatures | 515 |
Updatable ZeroKnowledge Databases | 174 |
Information and Quantum Theory | 199 |
Quantum Anonymous Transmissions | 217 |
Privacy and Anonymity | 236 |
Spreading Alerts Quietly and the Subgroup Escape Problem | 253 |
A Sender Verifiable MixNet and a New Proof of a Shuffle | 273 |
Universally Anonymizable PublicKey Encryption | 293 |
Cryptanalytic Techniques | 313 |
An Analysis of the XSL Algorithm | 333 |
Stream Cipher Cryptanalysis | 353 |
Schemes | 533 |
Key Agreement | 549 |
A Simple Threshold Authenticated Key Exchange from Short Secrets | 566 |
Examining IndistinguishabilityBased Proof Models for | 585 |
Theory and Practice | 605 |
Errors in Computational Complexity Proofs for Protocols | 624 |
Signatures | 644 |
Efficient Designated Confirmer Signatures Without Random Oracles | 662 |
Universally Convertible Directed Signatures | 682 |
Common terms and phrases
Advances in Cryptology adversary algorithm apply ASIACRYPT assume assumption attack block ciphers chosen plaintext collision commitment complexity compression function Computer Science consider construction cryptanalysis Crypto cryptographic database defined definition denote distribution efficient elliptic curves encryption scheme equations Eurocrypt given graph hash function HIBE identity-based input integer isogeny KASUMI key schedule keystream Lecture Notes Lemma linear linear cryptanalysis LNCS mix-net mix-server monomials multiple nodes Notes in Computer output pair parameter permutation players polynomial preimage preimage attacks privacy-preserving private key probability problem proof proposed protocol prove public key random oracle model related-key Rényi entropy round RSA-OAEP S-Boxes secret key Section sender server session key shared signature schemes simulator Springer Springer-Verlag step stream cipher string T-functions Theorem TMTO universally anonymizable update variables vector verifier zero-knowledge zero-knowledge proof