The SCEAS System
Navigation Menu

Conferences in DBLP

ASIACRYPT (asiacrypt)
2005 (conf/asiacrypt/2005)

  1. Pascal Paillier, Damien Vergnaud
    Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:1-20 [Conf]
  2. David Jao, Stephen D. Miller, Ramarathnam Venkatesan
    Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:21-40 [Conf]
  3. Phong Q. Nguyen, Jacques Stern
    Adapting Density Attacks to Low-Weight Knapsacks. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:41-58 [Conf]
  4. Vassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra
    Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:59-78 [Conf]
  5. Martin Hirt, Jesper Buus Nielsen
    Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:79-99 [Conf]
  6. Nuttapong Attrapadung, Hideki Imai
    Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:100-120 [Conf]
  7. Andreas Jakoby, Maciej Liskiewicz
    Revealing Additional Information in Two-Party Computations. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:121-135 [Conf]
  8. Vladimir Kolesnikov
    Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:136-155 [Conf]
  9. Zhifang Zhang, Mulan Liu, Liangliang Xiao
    Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:156-173 [Conf]
  10. Moses Liskov
    Updatable Zero-Knowledge Databases. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:174-198 [Conf]
  11. Renato Renner, Stefan Wolf
    Simple and Tight Bounds for Information Reconciliation and Privacy Amplification. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:199-216 [Conf]
  12. Matthias Christandl, Stephanie Wehner
    Quantum Anonymous Transmissions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:217-235 [Conf]
  13. Justin Brickell, Vitaly Shmatikov
    Privacy-Preserving Graph Algorithms in the Semi-honest Model. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:236-252 [Conf]
  14. James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
    Spreading Alerts Quietly and the Subgroup Escape Problem. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:253-272 [Conf]
  15. Douglas Wikström
    A Sender Verifiable Mix-Net and a New Proof of a Shuffle. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:273-292 [Conf]
  16. Ryotaro Hayashi, Keisuke Tanaka
    Universally Anonymizable Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:293-312 [Conf]
  17. Alexander Maximov, Thomas Johansson
    Fast Computation of Large Distributions and Its Cryptographic Applications. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:313-332 [Conf]
  18. Carlos Cid, Gaëtan Leurent
    An Analysis of the XSL Algorithm. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:333-352 [Conf]
  19. Jin Hong, Palash Sarkar
    New Applications of Time Memory Data Tradeoffs. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:353-372 [Conf]
  20. Frédéric Muller, Thomas Peyrin
    Linear Cryptanalysis of the TSC Family of Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:373-394 [Conf]
  21. Itsik Mantin
    A Practical Attack on the Fixed RC4 in the WEP Mode. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:395-411 [Conf]
  22. Joydip Mitra
    A Near-Practical Attack Against B Mode of HBB. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:412-424 [Conf]
  23. Sébastien Kunz-Jacques, Frédéric Muller
    New Improvements of Davies-Murphy Cryptanalysis. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:425-442 [Conf]
  24. Eli Biham, Orr Dunkelman, Nathan Keller
    A Related-Key Rectangle Attack on the Full KASUMI. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:443-461 [Conf]
  25. Lars R. Knudsen, Frédéric Muller
    Some Attacks Against a Double Length Hash Proposal. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:462-473 [Conf]
  26. Stefan Lucks
    A Failure-Friendly Design Principle for Hash Functions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:474-494 [Conf]
  27. Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai
    Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:495-514 [Conf]
  28. 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. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:515-532 [Conf]
  29. Toru Nakanishi, Nobuo Funabiki
    Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:533-548 [Conf]
  30. Caroline Kudla, Kenneth G. Paterson
    Modular Security Proofs for Key Agreement Protocols. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:549-565 [Conf]
  31. Michel Abdalla, Olivier Chevassut, Pierre-Alain Fouque, David Pointcheval
    A Simple Threshold Authenticated Key Exchange from Short Secrets. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:566-584 [Conf]
  32. Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock
    Examining Indistinguishability-Based Proof Models for Key Establishment Protocols. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:585-604 [Conf]
  33. Marc Girault, David Lefranc
    Server-Aided Verification: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:605-623 [Conf]
  34. Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock
    Errors in Computational Complexity Proofs for Protocols. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:624-643 [Conf]
  35. Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo
    Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature). [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:644-661 [Conf]
  36. Craig Gentry, David Molnar, Zulfikar Ramzan
    Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:662-681 [Conf]
  37. Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud
    Universally Convertible Directed Signatures. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:682-701 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002