default search action
ASIACRYPT 2005: Chennai, India
- Bimal K. Roy:
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. Lecture Notes in Computer Science 3788, Springer 2005, ISBN 3-540-30684-6
Algebra and Number Theory
- Pascal Paillier, Damien Vergnaud
:
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. 1-20 - David Jao
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? 21-40 - Phong Q. Nguyen, Jacques Stern:
Adapting Density Attacks to Low-Weight Knapsacks. 41-58 - Vassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra:
Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains. 59-78
Multiparty Computation
- Martin Hirt, Jesper Buus Nielsen
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. 79-99 - Nuttapong Attrapadung, Hideki Imai:
Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations. 100-120 - Andreas Jakoby, Maciej Liskiewicz:
Revealing Additional Information in Two-Party Computations. 121-135
Zero Knowledge and Secret Sharing
- Vladimir Kolesnikov:
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation. 136-155 - Zhifang Zhang, Mulan Liu, Liangliang Xiao:
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes. 156-173 - Moses D. Liskov:
Updatable Zero-Knowledge Databases. 174-198
Information and Quantum Theory
- Renato Renner, Stefan Wolf
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification. 199-216 - Matthias Christandl, Stephanie Wehner:
Quantum Anonymous Transmissions. 217-235
Privacy and Anonymity
- Justin Brickell, Vitaly Shmatikov:
Privacy-Preserving Graph Algorithms in the Semi-honest Model. 236-252 - James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta
Spreading Alerts Quietly and the Subgroup Escape Problem. 253-272 - Douglas Wikström:
A Sender Verifiable Mix-Net and a New Proof of a Shuffle. 273-292 - Ryotaro Hayashi, Keisuke Tanaka:
Universally Anonymizable Public-Key Encryption. 293-312
Cryptanalytic Techniques
- Alexander Maximov, Thomas Johansson:
Fast Computation of Large Distributions and Its Cryptographic Applications. 313-332 - Carlos Cid, Gaëtan Leurent
An Analysis of the XSL Algorithm. 333-352
Stream Cipher Cryptanalysis
- Jin Hong
New Applications of Time Memory Data Tradeoffs. 353-372 - Frédéric Muller, Thomas Peyrin:
Linear Cryptanalysis of the TSC Family of Stream Ciphers. 373-394 - Itsik Mantin:
A Practical Attack on the Fixed RC4 in the WEP Mode. 395-411 - Joydip Mitra:
A Near-Practical Attack Against B Mode of HBB. 412-424
Block Ciphers and Hash Functions
- Sébastien Kunz-Jacques, Frédéric Muller:
New Improvements of Davies-Murphy Cryptanalysis. 425-442 - Eli Biham, Orr Dunkelman, Nathan Keller:
A Related-Key Rectangle Attack on the Full KASUMI. 443-461 - Lars R. Knudsen, Frédéric Muller:
Some Attacks Against a Double Length Hash Proposal. 462-473 - Stefan Lucks:
A Failure-Friendly Design Principle for Hash Functions. 474-494
Bilinear Maps
- Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai:
Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application. 495-514 - Paulo S. L. M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques Quisquater:
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps. 515-532 - Toru Nakanishi, Nobuo Funabiki:
Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps. 533-548
Key Agreement
- Caroline Kudla, Kenneth G. Paterson:
Modular Security Proofs for Key Agreement Protocols. 549-565 - Michel Abdalla
A Simple Threshold Authenticated Key Exchange from Short Secrets. 566-584 - Kim-Kwang Raymond Choo
Examining Indistinguishability-Based Proof Models for Key Establishment Protocols. 585-604
Provable Security
- Marc Girault, David Lefranc:
Server-Aided Verification: Theory and Practice. 605-623 - Kim-Kwang Raymond Choo
Errors in Computational Complexity Proofs for Protocols. 624-643
Signatures
- Joonsang Baek
Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature). 644-661 - Craig Gentry, David Molnar, Zulfikar Ramzan:
Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs. 662-681 - Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud
Universally Convertible Directed Signatures. 682-701
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 19:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: