New Improvements of Davies-Murphy Cryptanalysis (English)
- New search for: Kunz-Jacques, S.
- New search for: Muller, F.
- New search for: Kunz-Jacques, S.
- New search for: Muller, F.
- New search for: Roy, Bimal
In:
Advances in cryptology - ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005 /
3788
;
425-442
;
2005
-
ISBN:
-
ISSN:
- Conference paper / Print
-
Title:New Improvements of Davies-Murphy Cryptanalysis
-
Contributors:
-
Conference:11th, Advances in cryptology - ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005 / ; 2005 ; Chennai, India
-
Published in:LECTURE NOTES IN COMPUTER SCIENCE , 3788 ; 425-442
-
Publisher:
- New search for: [Great Britain] :
-
Place of publication:Berlin , Springer , 2005.
-
Publication date:2005-01-01
-
Size:18 pages
-
Remarks:Includes bibliographical references and index.
-
ISBN:
-
ISSN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
-
Keywords:
-
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete LogPaillier, P. / Vergnaud, D. et al. | 2005
- 21
-
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?Jao, D. / Miller, S. D. / Venkatesan, R. et al. | 2005
- 41
-
Adapting Density Attacks to Low-Weight KnapsacksNguyen, P. Q. / Stern, J. et al. | 2005
- 59
-
Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base ChainsDimitrov, V. / Imbert, L. / Mishra, P. K. et al. | 2005
- 79
-
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty ComputationHirt, M. / Nielsen, J. B. et al. | 2005
- 100
-
Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient InstantiationsAttrapadung, N. / Imai, H. et al. | 2005
- 121
-
Revealing Additional Information in Two-Party ComputationsJakoby, A. / Liskiewicz, M. et al. | 2005
- 136
-
Gate Evaluation Secret Sharing and Secure One-Round Two-Party ComputationKolesnikov, V. et al. | 2005
- 156
-
Parallel Multi-party Computation from Linear Multi-secret Sharing SchemesZhang, Z. / Liu, M. / Xiao, L. et al. | 2005
- 174
-
Updatable Zero-Knowledge DatabasesLiskov, M. et al. | 2005
- 199
-
Simple and Tight Bounds for Information Reconciliation and Privacy AmplificationRenner, R. / Wolf, S. et al. | 2005
- 217
-
Quantum Anonymous TransmissionsChristandl, M. / Wehner, S. et al. | 2005
- 236
-
Privacy-Preserving Graph Algorithms in the Semi-honest ModelBrickell, J. / Shmatikov, V. et al. | 2005
- 253
-
Spreading Alerts Quietly and the Subgroup Escape ProblemAspnes, J. / Diamadi, Z. / Gjosteen, K. / Peralta, R. / Yampolskiy, A. et al. | 2005
- 273
-
A Sender Verifiable Mix-Net and a New Proof of a ShuffleWikstrom, D. et al. | 2005
- 293
-
Universally Anonymizable Public-Key EncryptionHayashi, R. / Tanaka, K. et al. | 2005
- 313
-
Fast Computation of Large Distributions and Its Cryptographic ApplicationsMaximov, A. / Johansson, T. et al. | 2005
- 333
-
An Analysis of the XSL AlgorithmCid, C. / Leurent, G. et al. | 2005
- 353
-
New Applications of Time Memory Data TradeoffsHong, J. / Sarkar, P. et al. | 2005
- 373
-
Linear Cryptanalysis of the TSC Family of Stream CiphersMuller, F. / Peyrin, T. et al. | 2005
- 395
-
A Practical Attack on the Fixed RC4 in the WEP ModeMantin, I. et al. | 2005
- 412
-
A Near-Practical Attack Against B Mode of HBBMitra, J. et al. | 2005
- 425
-
New Improvements of Davies-Murphy CryptanalysisKunz-Jacques, S. / Muller, F. et al. | 2005
- 443
-
A Related-Key Rectangle Attack on the Full KASUMIBiham, E. / Dunkelman, O. / Keller, N. et al. | 2005
- 462
-
Some Attacks Against a Double Length Hash ProposalKnudsen, L. R. / Muller, F. et al. | 2005
- 474
-
A Failure-Friendly Design Principle for Hash FunctionsLucks, S. et al. | 2005
- 495
-
Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its ApplicationHanaoka, Y. / Hanaoka, G. / Shikata, J. / Imai, H. et al. | 2005
- 515
-
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear MapsBarreto, P. S. L. M. / Libert, B. / McCullagh, N. / Quisquater, J.-J. et al. | 2005
- 533
-
Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear MapsNakanishi, T. / Funabiki, N. et al. | 2005
- 549
-
Modular Security Proofs for Key Agreement ProtocolsKudla, C. / Paterson, K. G. et al. | 2005
- 566
-
A Simple Threshold Authenticated Key Exchange from Short SecretsAbdalla, M. / Chevassut, O. / Fouque, P.-A. / Pointcheval, D. et al. | 2005
- 585
-
Examining Indistinguishability-Based Proof Models for Key Establishment ProtocolsChoo, K.-K. R. / Boyd, C. / Hitchcock, Y. et al. | 2005
- 605
-
Server-Aided Verification: Theory and PracticeGirault, M. / Lefranc, D. et al. | 2005
- 624
-
Errors in Computational Complexity Proofs for ProtocolsChoo, K.-K. R. / Boyd, C. / Hitchcock, Y. et al. | 2005
- 644
-
Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature)Baek, J. / Safavi-Naini, R. / Susilo, W. et al. | 2005
- 662
-
Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge ProofsGentry, C. / Molnar, D. / Ramzan, Z. et al. | 2005
- 682
-
Universally Convertible Directed SignaturesLaguillaumie, F. / Paillier, P. / Vergnaud, D. et al. | 2005