Volume 2003, 2003

• 
  Philip Hawkes, Gregory G. Rose: A Mode of Operation with Partial Encryption and Message Integrity. 1
• 
  John Proos: Imperfect Decryption and an Attack on the NTRU Encryption Scheme. 2
• 
  Eric Filiol: Plaintext-dependant Repetition Codes Cryptanalysis of Block Ciphers - The AES Case. 3
• 
  Divya Nalla, K. C. Reddy: ID-based tripartite Authenticated Key Agreement Protocols from pairings. 4
• 
  Keith M. Martin, Reihaneh Safavi-Naini, Huaxiong Wang, Peter R. Wild: Distributing the Encryption and Decryption of a Block Cipher. 5
• 
  Ventzislav Nikov, Svetla Nikova, Bart Preneel: Multi-Party Computation from any Linear Secret Sharing Scheme Secure against Adaptive Adversary: The Zero-Error Case. 6
• 
  Huafei Zhu: A Price Negotiable Transaction System. 7
• 
  Christophe Giraud: DFA on AES. 8
• 
  Palash Sarkar: Domain Extenders for UOWHF: A Finite Binary Tree Algorithm. 9
• 
  Pierre Dusart, Gilles Letourneux, Olivier Vivolo: Differential Fault Analysis on A.E.S. 10
• 
  Fangguo Zhang, Kwangjo Kim: Cryptanalysis of Lee-Hwang-Li's Key Authentication Scheme. 11
• 
  Marina Pudovkina: The number of initial states of the RC4 cipher with the same cycle structure. 12
• 
  Colin D. Walter: Security Constraints on the Oswald-Aigner Exponentiation Algorithm. 13
• 
  Palash Sarkar: Hiji-bij-bij: A New Stream Cipher with a Self-Synchronizing Mode of Operation. 14
• 
  Michael Backes, Birgit Pfitzmann, Michael Waidner: A Universally Composable Cryptographic Library. 15
• 
  Cheng-Kang Chu, Li-Shan Liu, Wen-Guey Tzeng: A Threshold GQ Signature Scheme. 16
• 
  Simon R. Blackburn: Perfect Hash Families with Few Functions. 17
• 
  Ho-Kyu Lee, Hyang-Sook Lee, Young-Ran Lee: An Authenticated Group Key Agreement Protocol on Braid groups. 18
• 
  Jung Hee Cheon, Byungheup Jun: A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem. 19
• 
  Bernhard Löhlein: Attacks based on Conditional Correlations against the Nonlinear Filter Generator. 20
• 
  Edith Elkind, Helger Lipmaa: Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. 21
• 
  Nicolas T. Courtois, Robert T. Johnson, Pascal Junod, Thomas Pornin, Michael Scott: Did Filiol Break AES ? 22
• 
  Benoît Libert, Jean-Jacques Quisquater: New identity based signcryption schemes from pairings. 23
• 
  Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt: On Modeling IND-CCA Security in Cryptographic Protocols. 24
• 
  D. Grigoriev. I. Ponomarenko: Homomorphic public-key cryptosystems and encrypting boolean circuits. 25
• 
  Jan Pelzl, Thomas J. Wollinger, Jorge Guajardo, Christof Paar: Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves (Update). 26
• 
  Andris Ambainis, Markus Jakobsson, Helger Lipmaa: Cryptographic Randomized Response Techniques. 27
• 
  Mathieu Ciet, Marc Joye: Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults. 28
• 
  Wenbo Mao, John Malone-Lee: Universal Padding Schemes for RSA with Optimal Bandwidth of Message Recovery. 29
• 
  Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-Party Computation over Rings. 30
• 
  Gene Itkis: Cryptographic Tamper Evidence. 31
• 
  Rosario Gennaro, Yehuda Lindell: A Framework for Password-Based Authenticated Key Exchange. 32
• 
  Gilles Piret, Jean-Jacques Quisquater: Integral Cryptanalysis on reduced-round Safer++. 33
• 
  Shafi Goldwasser, Yael Tauman: On the (In)security of the Fiat-Shamir Paradigm. 34
• 
  Kamil Kulesza, Zbigniew Kotulski, Josef Pieprzyk: On alternative approach for verifiable secret sharing. 35
• 
  Jean-Sébastien Coron: Cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem. 36
• 
  Juan A. Garay, Philip D. MacKenzie, Ke Yang: Strengthening Zero-Knowledge Protocols using Signatures. 37
• 
  Kazukuni Kobara, Hideki Imai: Pretty-Simple Password-Authenticated Key-Exchange Under Standard Assumptions. 38
• 
  Karl Rubin, Alice Silverberg: Torus-based cryptography. 39
• 
  Kishan Chand Gupta, Palash Sarkar: Computing Partial Walsh Transform from the Algebraic Normal Form of a Boolean Function. 40
• 
  Jovan Dj. Golic, Renato Menicocci: A new statistical distinguisher for the shrinking generator. 41
• 
  Juan A. Garay, Carl Pomerance: Timed Fair Exchange of Standard Signatures. 42
• 
  Yevgeniy Dodis, Michael J. Freedman, Shabsi Walfish: Parallel Signcryption with OAEP, PSS-R, and other Feistel Paddings. 43
• 
  Divya Nalla, K. C. Reddy: Signcryption scheme for Identity-based Cryptosystems. 44
• 
  Luis Hernández Encinas, Jaime Muñoz Masqué, A. Queiruga Dios: An algorithm to obtain an RSA modulus with a large private key. 45
• 
  Guilin Wang, Bo Zhu: Remarks on Saeednia's Identity-based Society Oriented Signature Scheme with Anonymous Signers. 46
• 
  Masao Kasahara, Ryuichi Sakai: A Construction of 100 bit Public-Key Cryptosystem and Digital Signature Scheme. 47
• 
  Edgar Martínez-Moro, Jorge Mozo-Fernández, Carlos Munuera: Compounding Secret Sharing Schemes. 48
• 
  Igor Shparlinski, Arne Winterhof: Hidden Number Problem in Small Subgroups. 49
• 
  Yevgeniy Dodis, Jee Hea An: Concealment and its Applications to Authenticated Encryption. 50
• 
  Markus Dichtl: How to Predict the Output of a Hardware Random Number Generator. 51
• 
  Vlastimil Klíma, Ondrej Pokorný, Tomás Rosa: Attacking RSA-based Sessions in SSL/TLS. 52
• 
  Iwan M. Duursma, Hyang-Sook Lee: Tate-pairing implementations for tripartite key agreement. 53
• 
  Ryuichi Sakai, Masao Kasahara: ID based Cryptosystems with Pairing on Elliptic Curve. 54
• 
  Xiaofeng Chen, Fangguo Zhang, Yumin Wang: A New Approach to Prevent Blackmailing in E-Cash. 55
• 
  Huafei Zhu, Feng Bao, Robert H. Deng: Computing of Trust in Distributed Networks. 56
• 
  Mario Di Raimondo, Rosario Gennaro: Secure Multiplication of Shared Secrets in the Exponent. 57
• 
  Edlyn Teske: An Elliptic Curve Trapdoor System. 58
• 
  Huafei Zhu, Feng Bao, Robert H. Deng: A Transitive Signature Scheme Provably Secure Against Adaptive Chosen-message Attack. 59
• 
  Jong Won Lee: Isomorphism Classes of Picard Curves over Finite Fields. 60
• 
  Ilia Toli: Hidden Polynomial Cryptosystems. 61
• 
  Rana Barua, Ratna Dutta, Palash Sarkar: Extending Joux's Protocol to Multi Party Key Agreement. 62
• 
  Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt: Initiator-Resilient Universally Composable Key Exchange. 63
• 
  Pascal Junod: On the Optimality of Linear, Differential and Sequential Distinguishers. 64
• 
  Mihir Bellare, Tadayoshi Kohno: Hash Function Balance and its Impact on Birthday Attacks. 65
• 
  Divya Nalla, K. C. Reddy: Signcryption scheme for Identity-based Cryptosystems. 66
• 
  Javier Herranz, Germán Sáez: Forking Lemmas in the Ring Signatures' Scenario. 67
• 
  Hung-Min Sun, Bin-Tsan Hsieh: On the Security of Some Proxy Signature Schemes. 68
• 
  Mihir Bellare, Phillip Rogaway, D. Wagner: EAX: A Conventional Authenticated-Encryption Mode. 69
• 
  Phillip Rogaway, David Wagner: A Critique of CCM. 70
• 
  Markus Jakobsson, John Linn, Joy Algesheimer: How to Protect Against a Militant Spammer. 71
• 
  Amit K. Awasthi, Sunder Lal: Proxy Blind Signature Scheme. 72
• 
  Sunder Lal, Amit K. Awasthi: A Scheme for obtaining a Warrant Message from the Digital Proxy Signatures. 73
• 
  Natsuki Ishida, Shin'ichiro Matsuo, Wakaha Ogata: Divisible Voting Scheme. 74
• 
  Kaoru Kurosawa: Almost Security of Cryptographic Boolean Functions. 75
• 
  N. Vijayarangan, Nitin Agarwal, S. Kasilingam: Goldbach's Conjecture on ECDSA Protocols. 76
• 
  Mihir Bellare, Alexandra Boldyreva, Adriana Palacio: An Uninstantiable Random-Oracle-Model Scheme for a Hybrid Encryption Problem. 77
• 
  Yodai Watanabe, Junji Shikata: Relation among simulator-based and comparison-based definitions of semantic security. 78
• 
  Stéphane Flon, Roger Oyono: Fast arithmetic on Jacobians of Picard curves. 79
• 
  Ivan Damgård, Jens Groth: Non-interactive and Reusable Non-malleable Commitment Schemes. 80
• 
  Philip Hawkes, Gregory G. Rose: Primitive Specification for SOBER-128. 81
• 
  Tetsu Iwata, Kaoru Kurosawa: Stronger Security Bounds for OMAC, TMAC and XCBC. 82
• 
  Ran Canetti, Shai Halevi, Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. 83
• 
  Jintai Ding, Timonthy Hodges: Cryptanalysis of an implementation scheme of the Tamed Transformation Method cryptosystem. 84
• 
  Jintai Ding, Dieter Schmidt: A defect of the implementation schemes of the TTM cryptosystem. 85
• 
  Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: On the Selection of Pairing-Friendly Groups. 86
• 
  Huafei Zhu: A Practical Elliptic Curve Public Key Encryption Scheme Provably Secure Against Adaptive Chosen-message Attack. 87
• 
  Alexander Rostovtsev, Elena Makhovenko: Elliptic Curve Point Multiplication. 88
• 
  Christopher Wolf: Efficient Public Key Generation for Multivariate Cryptosystems. 89
• 
  Chih-Yin Lin, Tzong-Chen Wu, Fangguo Zhang: A Structured Multisignature Scheme from the Gap Diffie-Hellman Group. 90
• 
  Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham: Sequential Aggregate Signatures from Trapdoor Permutations. 91
• 
  Muxiang Zhang: Provably-Secure Enhancement on 3GPP Authentication and Key Agreement Protocol. 92
• 
  Leonid Reyzin, Scott Russell: Simple Stateless Steganography. 93
• 
  Tanja Lange: Trace Zero Subvariety for Cryptosystems. 94
• 
  Yevgeniy Dodis, Nelly Fazio: Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack. 95
• 
  Alexandra Boldyreva, Adriana Palacio, Bogdan Warinschi: Secure Proxy Signature Schemes for Delegation of Signing Rights. 96
• 
  Jan Pelzl, Thomas J. Wollinger, Christof Paar: Low Cost Security: Explicit Formulae for Genus 4 Hyperelliptic Curves. 97
• 
  Vlastimil Klíma, Tomás Rosa: Side Channel Attacks on CBC Encrypted Messages in the PKCS#7 Format. 98
• 
  Matthew J. Campagna: Algorithms in Braid Groups. 99
• 
  Yehuda Lindell: Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model. 100
• 
  Ilia Toli: Cryptanalysis of HFE. 101
• 
  J. Hughes, A. Tannenbaum: Length-Based Attacks for Certain Group Based Encryption Rewriting Systems. 102
• 
  Zhongliang Chen: Security analysis on Nalla-Reddy's ID-based tripartite authenticated key agreement protocols. 103
• 
  Fangguo Zhang, Reihaneh Safavi-Naini, Chih-Yin Lin: New Proxy Signature, Proxy Blind Signature and Proxy Ring Signature Schemes from Bilinear Pairing. 104
• 
  Helger Lipmaa: On Diophantine Complexity and Statistical Zero-Knowledge Arguments. 105
• 
  Tadayoshi Kohno, John Viega, Doug Whiting: CWC: A high-performance conventional authenticated encryption mode. 106
• 
  David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar: Fujisaki-Okamoto IND-CCA hybrid encryption revisited. 107
• 
  Tri Van Le: Novel Cyclic and Algebraic Properties of AES. 108
• 
  Alex Biryukov, Christophe De Cannière, Gustaf Dellkrantz: Crytanalysis of SAFER++. 109
• 
  Yukio Itakura, Shigeo Tsujii: Proposal on Personal Authentication System in which Biological Information is embedded in Cryptosystem Key. 110
• 
  Jiqiang Lv, Jingwei Liu, Xinmei Wang: Further Cryptanalysis of some Proxy Signature Schemes. 111
• 
  Gene Tsudik, Shouhuai Xu: Accumulating Composites and Improved Group Signing. 112
• 
  Hung-Min Sun, Bin-Tsan Hsieh: Security Analysis of Shim's Authenticated Key Agreement Protocols from Pairings. 113
• 
  Michael Backes: Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions. 114
• 
  Kyungah Shim: Cryptanalysis of ID-based Tripartite Authenticated Key Agreement Protocols. 115
• 
  Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim: A New ID-based Group Signature Scheme from Bilinear Pairings. 116
• 
  Chih-Yin Lin, Tzong-Chen Wu: An identity-based ring signature scheme from bilinear pairings. 117
• 
  Pim Tuyls, Tom A. M. Kevenaar, Geert Jan Schrijen, Toine Staring, Marten van Dijk: Visual Crypto Displays Enabling Secure Communications. 118
• 
  Thomas J. Wollinger, Christof Paar: How Secure Are FPGAs in Cryptographic Applications? 119
• 
  Silvio Micali, Leonid Reyzin: Physically Observable Cryptography. 120
• 
  Michael Backes, Birgit Pfitzmann: A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol. 121
• 
  Kyungah Shim: Cryptanalysis of Al-Riyami-Paterson's Authenticated Three Party Key Agreement Protocols. 122
• 
  Vladimir Shpilrain: Assessing security of some group based cryptosystems. 123
• 
  Kishan Chand Gupta, Palash Sarkar: A General Correlation Theorem. 124
• 
  Nicolas T. Courtois: Algebraic Attacks on Combiners with Memory and Several Outputs. 125
• 
  Sattam S. Al-Riyami, Kenneth G. Paterson: Certificateless Public Key Cryptography. 126
• 
  B. Ya. Ryabko, V. A. Monarev: Using Information Theory Approach to Randomness Testing. 127
• 
  Alfred Menezes, Edlyn Teske, Annegret Weng: Weak Fields for ECC. 128
• 
  Fangguo Zhang, Reihaneh Safavi-Naini, Willy Susilo: Attack on Han et al.'s ID-based Confirmer (Undeniable) Signature at ACM-EC'03. 129
• 
  Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa: On the Pseudorandomness of KASUMI Type Permutations. 130
• 
  Kristian Gjsteen: Homomorphic public-key systems based on subgroup membership problems. 131
• 
  Adi Shamir, Boaz Tsaban: Guaranteeing the diversity of number generators. 132
• 
  Soumen Maity, Subhamoy Maitra: Minimum Distance between Bent and 1-resilient Boolean Functions. 133
• 
  Sugata Gangopadhyay, Subhamoy Maitra: Direct Sum of Non Normal and Normal Bent Functions Always Produces Non Normal Bent Functions. 134
• 
  Wenling Wu, Dengguo Feng: Collision Attack on Reduced-Round Camellia. 135
• 
  Boaz Tsaban, Uzi Vishne: Efficient linear feedback shift registers with maximal period. 136
• 
  Boaz Tsaban: Bernoulli numbers and the probability of a birthday surprise. 137
• 
  Boaz Tsaban: Permutation graphs, fast forward permutations, and. 138
• 
  Enjian Bai, Guozhen Xiao: On the Randomness of the Editing Generator. 139
• 
  Konstantin Hyppönen, David Naccache, Elena Trichina, Alexei Tchoulkine: Trading-Off Type-Inference Memory Complexity Against Communication. 140
• 
  Yehuda Lindell: General Composition and Universal Composability in Secure Multiparty Computation. 141
• 
  Mridul Nandi: A New Tree based Domain Extension of UOWHF. 142
• 
  Friederike Brezing, Annegret Weng: Elliptic curves suitable for pairing based cryptography. 143
• 
  Divya Nalla: ID-based tripartite key agreement with signatures. 144
• 
  Michael Backes, Birgit Pfitzmann, Michael Waidner: Symmetric Authentication Within a Simulatable Cryptographic Library. 145
• 
  Yevgeniy Dodis, Leonid Reyzin: Breaking and Repairing Optimistic Fair Exchange from PODC 2003. 146
• 
  Shai Halevi, Phillip Rogaway: A Parallelizable Enciphering Mode. 147
• 
  Shai Halevi, Phillip Rogaway: A Tweakable Enciphering Mode. 148
• 
  Danfeng Yao, Anna Lysyanskaya: Forward-Secure Hierarchical ID-Based Cryptography. 149
• 
  Ran Canetti, Oded Goldreich, Shai Halevi: On the random-oracle methodology as applied to length-restricted signature schemes. 150
• 
  Jaume Martí-Farré, Carles Padró: Secret sharing schemes on sparse homogeneous access structures with rank three. 151
• 
  Eric Brier, Christophe Clavier, Francis Olivier: Optimal Statistical Power Analysis. 152
• 
  Zhenfeng Zhang, Jing Xu, Dengguo Feng: Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem. 153
• 
  Cheryl L. Beaver, Timothy Draelos, Richard Schroeppel, Mark Torgerson: ManTiCore: Encryption with Joint Cipher-State Authentication. 154
• 
  Huafei Zhu: A Formal Proof of Zhu's Signature Scheme. 155
• 
  Tri Van Le: Efficient Provably Secure Public Key Steganography. 156
• 
  Kaoru Kurosawa, Tsuyoshi Takagi: Some RSA-based Encryption Schemes with Tight Security Reduction. 157
• 
  Mridul Nandi: A Sufficient Condition and Optimal Domain Extension of UOWHF. 158
• 
  Cesar Alison Monteiro Paixão: An efficient variant of the RSA cryptosystem. 159
• 
  Jiun-Ming Chen, Bo-Yin Yang: A More Secure and Efficacious TTS Signature Scheme. 160
• 
  Ueli Maurer, Renato Renner, Clemens Holenstein: Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. 161
• 
  Alex Biryukov, Joseph Lano, Bart Preneel: Cryptanalysis of the Alleged SecurID Hash Function. 162
• 
  Xavier Boyen: Multipurpose Identity-Based Signcryption : A Swiss Army Knife for Identity-Based Cryptography. 163
• 
  Joonsang Baek, Yuliang Zheng: Identity-Based Threshold Decryption. 164
• 
  Andreas Winter, Anderson C. A. Nascimento, Hideki Imai: Commitment Capacity of Discrete Memoryless Channels. 165
• 
  Igor Semaev: A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves. 166
• 
  Giuseppe Ateniese, Breno de Medeiros: Identity-based Chameleon Hash and Applications. 167
• 
  Jean-Camille Birget, Dawei Hong, Nasir D. Memon: Robust discretization, with an application to graphical passwords. 168
• 
  Boris Pogorelov, Marina Pudovkina: Properties of the Transformation Semigroup of the Solitaire Stream Cipher. 169
• 
  Mahalingam Ramkumar, Nasir D. Memon: HARPS: HAshed Random Preloaded Subset Key Distribution. 170
• 
  Jonathan Katz, Moti Yung: Scalable Protocols for Authenticated Group Key Exchange. 171
• 
  Nick Howgrave-Graham, Joseph H. Silverman, Ari Singer, William Whyte: NAEP: Provable Security in the Presence of Decryption Failures. 172
• 
  Palash Sarkar: Domain Extender for Collision Resistant Hash Functions: Improving Upon Merkle-Damgaard Iteration. 173
• 
  Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen: Relaxing Chosen-Ciphertext Security. 174
• 
  David Naccache: Double-Speed Safe Prime Generation. 175
• 
  Sugata Gangopadhyay, Pradipkumar H. Keskar, Subhamoy Maitra: Patterson-Wiedemann Construction Revisited. 176
• 
  Tadayoshi Kohno, Adriana Palacio, John Black: Building Secure Cryptographic Transforms, or How to Encrypt and MAC. 177
• 
  Huafei Zhu: Constructing Optimistic Fair Exchange Protocols from Committed Signatures. 178
• 
  Bartosz Zoltak: VMPC One-Way Function. 179
• 
  Pradeep Kumar Mishra, Palash Sarkar: Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves. 180
• 
  Rui Zhang, Goichiro Hanaoka, Junji Shikata, Hideki Imai: On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security? 181
• 
  Ran Canetti, Shai Halevi, Jonathan Katz: Chosen-Ciphertext Security from Identity-Based Encryption. 182
• 
  Craig Gentry: Certificate-Based Encryption and the Certificate Revocation Problem. 183
• 
  Nicolas T. Courtois, Guilhem Castagnos, Louis Goubin: What do DES S-boxes Say to Each Other ? 184
• 
  Bartosz Zoltak: VMPC Stream Cipher. 185
• 
  Michael J. Wiener: Safe Prime Generation with a Combined Sieve. 186
• 
  Tatsuaki Okamoto, Ryo Kashima: Resource Bounded Unprovability of Computational Lower Bounds. 187
• 
  Fei Hu, Chwan-Hwa Wu, J. D. Irwin: A New Forward Secure Signature Scheme using Bilinear Maps. 188
• 
  Zuhua Shao: Cryptanalysis of publicly verifiable authenticated encryption. 189
• 
  Rana Barua, Ratna Dutta, Palash Sarkar: Extending Joux's Protocol to Multi Party Key Agreement. 190
• 
  David Naccache, Nigel P. Smart, Jacques Stern: Projective Coordinates Leak. 191
• 
  Ron Steinfeld, Laurence Bull, Huaxiong Wang, Josef Pieprzyk: Universal Designated-Verifier Signatures. 192
• 
  Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk: Efficient Extension of Standard Schnorr/RSA signatures into Universal Designated-Verifier Signatures. 193
• 
  Guilin Wang: Security Analysis of Several Group Signature Schemes. 194
• 
  Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano: Public Key Encryption with keyword Search. 195
• 
  Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng: Security Analysis of Some Proxy Signatures. 196
• 
  Javier Herranz, Germán Sáez: Revisiting fully distributed proxy signature schemes. 197
• 
  Kishan Chand Gupta, Palash Sarkar: Construction of Perfect Nonlinear and Maximally Nonlinear Multi-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria. 198
• 
  Simon R. Blackburn, Kenneth G. Paterson: Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. 199
• 
  Zheng Dong, Shengli Liu, Kefei Chen: Cryptanalysis of B.Lee-S.Kim-K.Kim Proxy Signature. 200
• 
  Zheng Dong, Kefei Chen: an attack on a multisignature scheme. 201
• 
  Willi Geiselmann, Rainer Steinwandt: Yet Another Sieving Device. 202
• 
  Masanobu Katagi, Izuru Kitamura, Toru Akishita, Tsuyoshi Takagi: Novel Efficient Implementations of Hyperelliptic Curve Cryptosystems using Degenerate Divisors. 203
• 
  Xiangyong Zeng, Lei Hu: A Composition Construction of Bent-Like Boolean Functions from Quadratic Polynomials. 204
• 
  Scott Contini, Yiqun Lisa Yin: Improved Cryptanalysis of SecurID. 205
• 
  Benoît Libert, Jean-Jacques Quisquater: Identity Based Undeniable Signatures. 206
• 
  Guilin Wang, Sihan Qing: Security Flaws in Several Group Signatures Proposed by Popescu. 207
• 
  Fangguo Zhang, Reihaneh Safavi-Naini, Willy Susilo: ID-Based Chameleon Hashes from Bilinear Pairings. 208
• 
  Daniel Augot, Matthieu Finiasz, Pierre Loidreau: Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem presented at Eurocrypt 2003. 209
• 
  Ventzislav Nikov, Svetla Nikova: On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes. 210
• 
  Nicolas T. Courtois, Louis Goubin, Jacques Patarin: SFLASHv3, a fast asymmetric signature scheme. 211
• 
  Jan Pelzl, Thomas J. Wollinger, Christof Paar: High Performance Arithmetic for Hyperelliptic Curve Cryptosystems of Genus Two. 212
• 
  YoungJu Choie, Eunkyung Jeong: Isomorphism Classes of Hyperelliptic Curves of Genus 2 over $\mathbb{F}_{2^n}$. 213
• 
  Rosario Gennaro: Multi-Trapdoor Commitments and their Applications to Non-Malleable Protocols. 214
• 
  Bo Yang, Ramesh Karri, David A. McGrew: Divide and Concatenate: A Scalable Hardware Architecture for Universal MAC. 215
• 
  Eu-Jin Goh: Secure Indexes. 216
• 
  Eric Brier, David Naccache, Pascal Paillier: Chemical Combinatorial Attacks on Keyboards. 217
• 
  David Wagner: A Security Evaluation of Whitenoise. 218
• 
  Jean-Sébastien Coron: Cryptanalysis of the Repaired Public-key Encryption Scheme Based on the Polynomial Reconstruction Problem. 219
• 
  Willi Geiselmann, Rainer Steinwandt: A short comment on the affine parts of SFLASH^{v3}. 220
• 
  Jung Hee Cheon, Hyun Soo Nam: A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homomophism. 221
• 
  Chunming Tang, Zhuojun Liu, Mingsheng Wang: A Verifiable Secret Sharing Scheme with Statistical zero-knowledge. 222
• 
  Simon R. Blackburn, Carlos Cid, Steven D. Galbraith: Cryptanalysis of a Cryptosystem based on Drinfeld modules. 223
• 
  Palash Sarkar: Masking Based Domain Extenders for UOWHFs: Bounds and Constructions. 225
• 
  Guilin Wang: On the Security of a Group Signature Scheme with Forward Security. 226
• 
  Willi Geiselmann, Rainer Steinwandt: Attacks on a Secure Group Communication Scheme With Hierarchical Access Control. 227
• 
  Huafei Zhu: Verifiably Committed Signatures Provably Secure in The Standard Complexity Model. 228
• 
  Dong Hoon Lee, Jaeheon Kim, Jin Hong, Jae Woo Han, Dukjae Moon: Algebraic Attacks on Summation Generators. 229
• 
  Daniel Augot, Matthieu Finiasz, Nicolas Sendrier: A Fast Provably Secure Cryptographic Hash Function. 230
• 
  Michael Backes, Christian Cachin: Public-Key Steganography with Active Attacks. 231
• 
  Chunming Tang, Zhuojun Liu, Jinwang Liu: The Statistical Zero-knowledge Proof for Blum Integer Based on Discrete Logarithm. 232
• 
  Luis von Ahn, Nicholas J. Hopper: Public Key Steganography. 233
• 
  Gene Itkis, Peng Xie: Generalized Key-Evolving Signature Schemes or How to Foil an Armed Adversary. 234
• 
  Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. 235
• 
  Elena Trichina: Combinational Logic Design for AES SubByte Transformation on Masked Data. 236
• 
  Benoît Chevallier-Mames, Mathieu Ciet, Marc Joye: Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity. 237
• 
  Xinjun Du, Ying Wang, Jianhua Ge, Yumin Wang: Chameleon Signature from Bilinear Pairing. 238
• 
  Ran Canetti: Universally Composable Signatures, Certification and Authentication. 239
• 
  Michael Backes, Dennis Hofheinz: How to Break and Repair a Universally Composable Signature Functionality. 240
• 
  Shaoquan Jiang, Guang Gong: Hybrid Broadcast Encryption and Security Analysis. 241
• 
  Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery: Improved Weil and Tate pairings for elliptic and hyperelliptic curves. 242
• 
  Guilin Wang: An Attack on Not-interactive Designated Verifier Proofs for Undeniable Signatures. 243
• 
  Tri Van Le, Kaoru Kurosawa: Efficient Public Key Steganography Secure Against Adaptively Chosen Stegotext Attacks. 244
• 
  Willi Geiselmann, Rainer Steinwandt: A Key Substitution Attack on SFLASH^{v3}. 245
• 
  Xin Lü, Dengguo Feng: Quantum Digital Signature Based on Quantum One-way Functions. 246
• 
  Xinjun Du, Ying Wang, Jianhua Ge, Yumin Wang: ID-based Authenticated Two Round Multi-Party Key Agreement. 247
• 
  Izuru Kitamura, Masanobu Katagi: Efficient Implementation of Genus Three Hyperelliptic Curve Cryptography over GF(2^n). 248
• 
  Stephen Boren, Andre Brisson: Software Specifications For Tinnitus Utilizing Whitenoise(Revised Feb 2004). 249
• 
  Hongjun Wu: Breaking the Stream Cipher Whitenoise. 250
• 
  EunKyung Jeong: Isomorphism Classes of Hyperelliptic Curves of genus 3 over finite fields. 251
• 
  Philip D. MacKenzie, Ke Yang: On Simulation-Sound Trapdoor Commitments. 252
• 
  Roberto Maria Avanzi: Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations. 253
• 
  Yitchak Gertner, Amir Herzberg: Committing Encryption and Publicly-Verifiable SignCryption. 254
• 
  Peter Fairbrother: Improved Constructions for Universal Re-encryption. 255
• 
  Jianying Zhou: On the Security of a Multi-Party Certified Email Protocol. 256
• 
  Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. Montgomery: Trading Inversions for Multiplications in Elliptic Curve Cryptography. 257
• 
  Marcin Rogawski: Analysis of Implementation Hierocrypt-3 algorithm (and its comparison to Camellia algorithm) using ALTERA devices. 258
• 
  Fangguo Zhang, Xiaofeng Chen: Attack on Two ID-based Authenticated Group Key Agreement Schemes. 259
• 
  Xinjun Du, Ying Wang, Jianhua Ge, Yumin Wang: An Improved ID-based Authenticated Group Key Agreement Scheme. 260
• 
  Javier Herranz, Germán Sáez: A provably secure ID-based ring signature scheme. 261
• 
  Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming Yiu, K. P. Chow: A Secure Modified ID-Based Undeniable Signature Scheme. 262
• 
  Manik Lal Das, Ashutosh Saxena, Ved Prakash Gulati: Security Analysis of Lal and Awasthi's Proxy Signature Schemes. 263
• 
  Pradeep Kumar Mishra, Palash Sarkar: Inversion of Several Field Elements: A New Parallel Algorithm. 264
• 
  Yunlei Zhao: Concurrent/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public-Key Model and Its Applications. 265

last updated on Sat May 18 06:09:31 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page