Volume 2002, 2002

• 
  Markus Jakobsson: Fractal Hash Sequence Representation and Traversal. 1
• 
  Jens Groth: Evaluating Security of Voting Schemes in the Universal Composability Framework. 2
• 
  Jorge Nakahara Jr., Bart Preneel, Joos Vandewalle: Square Attacks on Reduced-Round Variants of the Skipjack Block Cipher. 3
• 
  Kenneth G. Paterson: ID-based Signatures from Pairings on Elliptic Curves. 4
• 
  Hongjun Wu, Feng Bao: Cryptanalysis of Stream Cipher COS (2, 128) Mode I. 5
• 
  Karl Rubin, Alice Silverberg: The best and worst of supersingular abelian varieties in cryptology. 6
• 
  Wieland Fischer, Christophe Giraud, Erik Woodward Knudsen, Jean-Pierre Seifert: Parallel scalar multiplication on general elliptic curves over F_p hedged against Non-Differential Side-Channel Attacks. 7
• 
  Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott: Efficient Algorithms for Pairing-Based Cryptosystems. 8
• 
  Yongdae Kim, Adrian Perrig, Gene Tsudik: Tree-based Group Key Agreement. 9
• 
  Serge Lefranc, David Naccache: Cut and Paste Attacks with Java. 10
• 
  Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen: Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages. 11
• 
  Florian Hess: Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings. 12
• 
  Ivan Damgård, Maciej Koprowski: Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. 13
• 
  Leonid Reyzin, Natan Reyzin: Better than BiBa: Short One-time Signatures with Fast Signing and Verifying. 14
• 
  Eva Jencusova: Security proofs of cryptographic protocols. 15
• 
  Ron Steinfeld, Laurence Bull, Yuliang Zheng: Content Extraction Signatures. 16
• 
  Marc Fischlin: The Cramer-Shoup Strong-RSA Signature Scheme Revisited. 17
• 
  Jae Choon Cha, Jung Hee Cheon: An Identity-Based Signature from Gap Diffie-Hellman Groups. 18
• 
  Shai Halevi, Don Coppersmith, Charanjit S. Jutla: Scream: a software-efficient stream cipher. 19
• 
  Don Coppersmith, Shai Halevi, Charanjit S. Jutla: Cryptanalysis of stream ciphers with linear masking. 20
• 
  Kanstantsin Miranovich: Spectral Analysis of Boolean Functions under Non-uniformity of Arguments. 21
• 
  Michel Abdalla, Jee Hea An, Mihir Bellare, Chanathip Namprempre: From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. 22
• 
  Don Coppersmith, Markus Jakobsson: Almost Optimal Hash Sequence Traversal. 23
• 
  Juan A. Garay, Markus Jakobsson: Timed Release of Standard Digital Signatures. 24
• 
  Markus Jakobsson, Ari Juels, Ronald L. Rivest: Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking. 25
• 
  Daniel R. L. Brown: Generic Groups, Collision Resistance, and ECDSA. 26
• 
  Jonathan Katz: Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications. 27
• 
  Jung Hee Cheon: A Universal Forgery of Hess's Second ID-based Signature against the Known-message Attack. 28
• 
  Joy Algesheimer, Jan Camenisch, Victor Shoup: Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. 29
• 
  Boris Ryabko: Adaptive chi-square test and its application to some cryptographic problems. 30
• 
  Palash Sarkar, Paul J. Schellenberg: A Parallelizable Design Principle for Cryptographic Hash Functions. 31
• 
  YoungJu Choie, Eunkyung Jeong, Eunjeong Lee: Supersingular Hyperelliptic Curve of Genus 2 over Finite Fields. 32
• 
  Yodai Watanabe, Junji Shikata, Hideki Imai: Equivalence between semantic security and indistinguishability against chosen ciphertext attacks. 33
• 
  Jakob Jonsson: An OAEP Variant With a Tight Security Proof. 34
• 
  Sattam S. Al-Riyami, Kenneth G. Paterson: Tripartite Authenticated Key Agreement Protocols from Pairings. 35
• 
  Ronald Cramer, Serge Fehr: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. 36
• 
  David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar: An efficient semantically secure elliptic curve cryptosystem based on KMOV. 37
• 
  Javier Herranz, Carles Padró, Germán Sáez: A Distributed RSA Signature Scheme for General Access Structures. 38
• 
  Shaoquan Jiang, Yufeng Zhang: Partial Key Escrow Monitoring Scheme. 39
• 
  Shafi Goldwasser, Yehuda Lindell: Secure Computation Without Agreement. 40
• 
  Eli Biham, Orr Dunkelman, Nathan Keller: New Results on Boomerang and Rectangle Attack. 41
• 
  Edith Elkind, Amit Sahai: A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack. 42
• 
  Boaz Barak, Yehuda Lindell: Strict Polynomial-time in Simulation and Extraction. 43
• 
  Nicolas Courtois, Josef Pieprzyk: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. 44
• 
  Dr. K. S. Ooi, Brain Chin Vito: Cryptanalysis of S-DES. 45
• 
  Jee Hea An, Yevgeniy Dodis, Tal Rabin: On the Security of Joint Signature and Encryption. 46
• 
  Ran Canetti, Tal Rabin: Universal Composition with Joint State. 47
• 
  Maria Isabel Gonzalez Vasco, Consuelo Martínez, Rainer Steinwandt: Towards a Uniform Description of Several Group Based Cryptographic Primitives. 48
• 
  Alexander Kholosha, Henk C. A. van Tilborg: Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties. 49
• 
  Jaume Martí-Farré, Carles Padró: Secret sharing schemes with three or four minimal qualified subsets. 50
• 
  Javier Herranz, Germán Sáez: Fully Distributed Proxy Signature Schemes. 51
• 
  Stefan Lucks: A Variant of the Cramer-Shoup Cryptosystem for Groups with Unknwon Order. 52
• 
  Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger: Extended Validity and Consistency in Byzantine Agreement. 53
• 
  Gene Itkis, Leonid Reyzin: SiBIR: Signer-Base Intrusion-Resilient Signatures. 54
• 
  Manoj Prabhakaran, Amit Sahai: Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity. 55
• 
  Craig Gentry, Alice Silverberg: Hierarchical ID-Based Cryptography. 56
• 
  Yehuda Lindell: A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions. 57
• 
  Palash Sarkar: Construction of UOWHF: Tree Hashing Revisited. 58
• 
  Ran Canetti, Hugo Krawczyk: Universally Composable Notions of Key Exchange and Secure Channels. 59
• 
  Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. 60
• 
  Vlastimil Klíma, Tomás Rosa: Strengthened Encryption in the CBC Mode. 61
• 
  Dieter Schmidt: ABC - A Block Cipher. 62
• 
  M. Jason Hinek, Mo King Low, Edlyn Teske: On some Attacks on Multi-prime RSA. 63
• 
  Mihir Bellare, Adriana Palacio: Protecting against Key Exposure: Strongly Key-Insulated Encryption with Optimal Threshold. 64
• 
  Chanathip Namprempre: Secure Channels based on Authenticated Encryption Schemes: A Simple Characterization. 65
• 
  John Black, Phillip Rogaway, Thomas Shrimpton: Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. 66
• 
  Ilya Mironov: (Not So) Random Shuffles of RC4. 67
• 
  Scott Fluhrer: Improved key recovery of level 1 of the Bluetooth Encryption System. 68
• 
  Vanesa Daza, Javier Herranz, Carles Padró, Germán Sáez: A Distributed and Computationally Secure Key Distribution Scheme. 69
• 
  Jens-Matthias Bohli, Maria Isabel Gonzalez Vasco, Consuelo Martínez, Rainer Steinwandt: Weak Keys in MST1. 70
• 
  Vlastimil Klíma, Tomás Rosa: Further Results and Considerations on Side Channel Attacks on RSA. 71
• 
  Ben Lynn: Authenticated Identity-Based Encryption. 72
• 
  Christian Aumüller, Peter Bier, Peter Hofreiter, Wieland Fischer, Jean-Pierre Seifert: Fault attacks on RSA with CRT: Concrete Results and Practical Countermeasures. 73
• 
  Louis Granboulan: How to repair ESIGN. 74
• 
  Johannes Blömer, Jean-Pierre Seifert: Fault based cryptanalysis of the Advanced Encryption Standard. 75
• 
  Vlastimil Klíma, Tomás Rosa: Attack on Private Signature Keys of the OpenPGP Format, PGP(TM) Programs and Other Applications Compatible with OpenPGP. 76
• 
  Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung: Key-Insulated Public-Key Cryptosystems. 77
• 
  Mihir Bellare, Tadayoshi Kohno, Chanathip Namprempre: Breaking and Provably Repairing the SSH Authenticated Encryption Scheme: A Case Study of the Encode-then-Encrypt-and-MAC Paradigm. 78
• 
  Erik Zenner: On the efficiency of the Clock Control Guessing Attack. 79
• 
  Dan Boneh, Alice Silverberg: Applications of Multilinear Forms to Cryptography. 80
• 
  Vanesa Daza, Javier Herranz, Germán Sáez: Some Applications of Threshold Signature Schemes to Distributed Protocols. 81
• 
  Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp: Authentication of Quantum Messages. 82
• 
  David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar: A semantically secure elliptic curve RSA scheme with small expansion factor. 83
• 
  Amir Herzberg: Towards Provably-Secure Timed E-Commerce: The Trusted Delivery Layer. 84
• 
  Matthias Fitzi, Juan A. Garay: Efficient and Player-Optimal Strong Consensus. 85
• 
  Alexander W. Dent: Adapting the weaknesses of the Random Oracle model to the Generic Group model. 86
• 
  Nicolas T. Courtois: Higher Order Correlation Attacks, XL algorithm and Cryptanalysis of Toyocrypt. 87
• 
  Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: Constructing Elliptic Curves with Prescribed Embedding Degrees. 88
• 
  Oded Goldreich, Yoad Lustig, Moni Naor: On Chosen Ciphertext Security of Multiple Encryptions. 89
• 
  Daniele Micciancio, Erez Petrank: Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol. 90
• 
  Jovan Dj. Golic: Multiplicative Masking and Power Analysis of AES. 91
• 
  Kaoru Kurosawa, Tetsu Iwata: TMAC: Two-Key CBC MAC. 92
• 
  Ari Juels, Madhu Sudan: A Fuzzy Vault Scheme. 93
• 
  Régis Dupont, Andreas Enge, François Morain: Building curves with arbitrary small MOV degree over finite prime fields. 94
• 
  Ali Adel Kanso: The (a, b)-Shrinking Generator. 95
• 
  James Xiao, Yongxin Zhou: Generating Large Non-Singular Matrices over an Arbitrary Field with Blocks of Full Rank. 96
• 
  Huafei Zhu: A new public key encryption scheme provably secure against adaptive chosen cipher-text attack. 97
• 
  John Malone-Lee: Identity-Based Signcryption. 98
• 
  Eric Filiol: A New Statistical Testing for Symmetric Ciphers and Hash Functions. 99
• 
  John Black, Phillip Rogaway, Thomas Shrimpton: Encryption-Scheme Security in the Presence of Key-Dependent Messages. 100
• 
  Simon R. Blackburn: An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. 101
• 
  Ventzislav Nikov, Svetla Nikova, Bart Preneel, Joos Vandewalle: Applying General Access Structure to Metering Schemes. 102
• 
  Yevgeniy Dodis, Leonid Reyzin: On the Power of Claw-Free Permutations. 103
• 
  Anton Kozlov, Leonid Reyzin: Forward-Secure Signatures with Fast Key Update. 104
• 
  Jan Denef, Frederik Vercauteren: An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2. 105
• 
  Jaume Martí-Farré, Carles Padró: Secret sharing schemes on access structures with intersection number equal to one. 106
• 
  Tanja Lange: Efficient Arithmetic on Hyperelliptic Curves. 107
• 
  Ali Adel Kanso: Clock-Controlled Alternating Step Generator. 108
• 
  Qi Cheng: A New Class of Unsafe Primes. 109
• 
  Oded Goldreich: The GGM Construction does NOT yield Correlation Intractable Function Ensembles. 110
• 
  Joanne Fuller, William Millan: On Linear Redundancy in the AES S-Box. 111
• 
  Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery: An Efficient Procedure to Double and Add Points on an Elliptic Curve. 112
• 
  Yacov Yacobi: A Note on the Bilinear Diffie-Hellman Assumption. 113
• 
  Nigel P. Smart, E. J. Westwood: Point Multiplication on Ordinary Elliptic Curves over Fields of Characteristic Three. 114
• 
  Jean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier: Universal Padding Schemes for RSA. 115
• 
  Claude Castelluccia: How to convert any ID-based Signature Schemes. 116
• 
  Jung Hee Cheon, Dong Hoon Lee: Diffie-Hellman Problems and Bilinear Maps. 117
• 
  Alexandra Boldyreva: Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme. 118
• 
  Bodo Möller: Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes. 119
• 
  Ran Canetti, Hugo Krawczyk: Security Analysis of IKE's Signature-based Key-Exchange Protocol. 120
• 
  Tanja Lange: Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. 121
• 
  Fangguo Zhang, Shengli Liu, Kwangjo Kim: ID-Based One Round Authenticated Tripartite Key Agreement Protocol with Pairings. 122
• 
  Kaoru Kurosawa, Tetsu Iwata, Takayuki Yoshiwara: New covering radius of Reed-Muller codes for t-resilient functions. 123
• 
  Helger Lipmaa: On Optimal Hash Tree Traversal for Interval Time-Stamping. 124
• 
  Olivier Billet, Marc Joye: The Jacobi Model of an Elliptic Curve and Side-Channel Analysis. 125
• 
  Ahmad-Reza Sadeghi, Michael Steiner: Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference. 126
• 
  Kaoru Kurosawa: Power of a Public Random Permutation and its Application to Authenticated-Encryption. 127
• 
  Yvo Desmedt, Yongge Wang: Perfectly Secure Message Transmission Revisited. 128
• 
  Tomás Rosa: Key-collisions in (EC)DSA: Attacking Non-repudiation. 129
• 
  Kazukuni Kobara, Hideki Imai: OAEP++ : A Very Simple Way to Apply OAEP to Deterministic OW-CPA Primitives. 130
• 
  Nenad Dedic, Leonid Reyzin, Salil P. Vadhan: An Improved Pseudorandom Generator Based on Hardness of Factoring. 131
• 
  Charanjit S. Jutla: Tight Lower Bound on Linear Authenticated Encryption. 132
• 
  Yevgeniy Dodis: Efficient Construction of (Distributed) Verifiable Random Functions. 133
• 
  Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl: Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. 134
• 
  Amir Herzberg: Folklore, Practice and Theory of Robust Combiners. 135
• 
  Régis Dupont, Andreas Enge: Practical Non-Interactive Key Distribution Based on Pairings. 136
• 
  Nicholas J. Hopper, John Langford, Luis von Ahn: Provably Secure Steganography. 137
• 
  Nicolas T. Courtois, Magnus Daum, Patrick Felke: On the Security of HFE, HFEv- and Quartz. 138
• 
  Maria Isabel Gonzalez Vasco, Rainer Steinwandt: Reaction Attacks on Public Key Cryptosystems Based on the Word Problem. 139
• 
  Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai: Universally Composable Two-Party and Multi-Party Secure Computation. 140
• 
  Ventzislav Nikov, Svetla Nikova, Bart Preneel, Joos Vandewalle: Applying General Access Structure to Proactive Secret Sharing Schemes. 141
• 
  Gregory G. Rose, Philip Hawkes: On the Applicability of Distinguishing Attacks Against Stream Ciphers. 142
• 
  Willi Geiselmann, Willi Meier, Rainer Steinwandt: An Attack on the Isomorphisms of Polynomials Problem with One Secret. 143
• 
  Amr M. Youssef, Stafford E. Tavares: On Some Algebraic Structures in the AES Round Function. 144
• 
  Peter J. Leadbitter, Nigel P. Smart: Cryptanalysis of MQV with partially known nonces. 145
• 
  Jun-Bum Shin, Kwang H. Lee: Bauer-Berson-Feiertag attack revisited. 146
• 
  Tanja Lange: Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves. 147
• 
  Phillip Rogaway: The EMD Mode of Operation (A Tweaked, Wide-Blocksize, Strong PRP). 148
• 
  Nicolas T. Courtois: About Filliol's Observations on DES, AES and Hash Functions (draft). 149
• 
  Guilin Wang, Jianying Zhou, Robert H. Deng: Cryptanalysis of the Lee-Hwang Group-Oriented Undeniable Signature Schemes. 150
• 
  Jason E. Holt, Kent E. Seamons: Selective disclosure credential sets. 151
• 
  Jorge Nakahara Jr., Bart Preneel, Joos Vandewalle: A note on Weak Keys of PES, IDEA and some Extended Variants. 152
• 
  Tanja Lange: Weighted Coordinates on Genus 2 Hyperelliptic Curves. 153
• 
  Roberto Maria Avanzi: On multi-exponentiation in cryptography. 154
• 
  Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. 155
• 
  Jianying Zhou, Feng Bao, Robert H. Deng: Validating Digital Signatures without Time-Stamping and Certificate Revocation. 156
• 
  Elad Barkan, Eli Biham: In How Many Ways Can You Write Rijndael? 157
• 
  Elad Barkan, Eli Biham: The Book of Rijndaels. 158
• 
  Tadayoshi Kohno: Related-Key and Key-Collision Attacks Against RMAC. 159
• 
  Matt Blaze: Cryptology and Physical Security: Rights Amplification in Master-Keyed Mechanical Locks. 160
• 
  Jan Camenisch, Victor Shoup: Practical Verifiable Encryption and Decryption of Discrete Logarithms. 161
• 
  Salil P. Vadhan: On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model. 162
• 
  N. Asokan, Valtteri Niemi, Kaisa Nyberg: Man-in-the-Middle in Tunnelled Authentication Protocols. 163
• 
  Mike Scott: Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number. 164
• 
  Ari Juels, Dario Catalano, Markus Jakobsson: Coercion-Resistant Electronic Elections. 165
• 
  Ho-Kyu Lee, Hyang-Sook Lee, Young-Ran Lee: Multi-Party Authenticated Key Agreement Protocols from Multilinear Forms. 166
• 
  Fangguo Zhang, Kwangjo Kim: Cryptanalysis of Two New Signature Schemes. 167
• 
  Ki Hyoung Ko, Doo Ho Choi, Mi Sung Cho, Jang-Won Lee: New Signature Scheme Using Conjugacy Problem. 168
• 
  Dan Page: Theoretical Use of Cache Memory as a Cryptanalytic Side-Channel. 169
• 
  Jack Lloyd: An Analysis of RMAC. 170
• 
  Marina Pudovkina: Statistical weaknesses in the alleged RC4 keystream generator. 171
• 
  Louis Granboulan: PECDSA. How to build a DL-based digital signature scheme with the best proven security. 172
• 
  Giuseppe Ateniese, Breno de Medeiros: Efficient Group Signatures without Trapdoors. 173
• 
  Alexander W. Dent: A Designer's Guide to KEMs. 174
• 
  Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. 175
• 
  Masahiko Takenaka, Takeshi Shimoyama, Takeshi Koshiba: Theoretical Analysis of "Correlations in RC6". 176
• 
  Jianhong Zhang, Jilin Wang, Yumin Wang: two attacks on xia-you Group Signature. 177
• 
  Fangguo Zhang, Shengli Liu, Kwangjo Kim: Attack on A New Public Key Cryptosystem from ISC'02 (LNCS 2433). 178
• 
  Juan Manuel Garcia Garcia, Rolando Menchaca Garcia: Parallel Algorithm for Multiplication on Elliptic Curves. 179
• 
  Tetsu Iwata, Kaoru Kurosawa: OMAC: One-Key CBC MAC. 180
• 
  Eisaku Furukawa, Mitsuru Kawazoe, Tetsuya Takahashi: Counting Points for Hyperelliptic Curves of type y²x⁵+ax over Finite Prime Fields. 181
• 
  Wakaha Ogata, Kaoru Kurosawa: Oblivious Keyword Search. 182
• 
  Claude Crépeau, Alain Slakmon: Simple backdoors to RSA key generation. 183
• 
  Liqun Chen, Caroline Kudla: Identity Based Authenticated Key Agreement Protocols from Pairings. 184
• 
  Gregory G. Rose, Philip Hawkes: Turing, a fast stream cipher. 185
• 
  Oded Goldreich: Zero-Knowledge twenty years after its invention. 186
• 
  Hervé Sibert, Patrick Dehornoy, Marc Girault: Entity Authentication Schemes Using Braid Word Reduction. 187
• 
  Daewan Han, Jin Hong, Jae Woo Han, Daesung Kwon: Key recovery attacks on NTRU without ciphertext validation routine. 188
• 
  Kaoru Kurosawa, Wakaha Ogata: Bit-Slice Auction Circuit. 189
• 
  W. Eric Hall, Charanjit S. Jutla: Parallelizable Authentication Trees. 190
• 
  Frederik Armknecht: A Linearization Attack on the Bluetooth Key Stream Generator. 191
• 
  Emmanuel Bresson, Olivier Chevassut, David Pointcheval: Security Proofs for an Efficient Password-Based Key Exchange. 192
• 
  Michael J. Collins: A Note on Ideal Tripartite Access Structures. 193
• 
  Pim Tuyls, Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen: A polarisation based Visual Crypto System and its Secret Sharing Schemes. 194
• 
  Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen, Pim Tuyls: An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes. 195

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