Foreword Preface Contents Author Index Keyword Index Search Help

Author Index

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Abadi, M.
  • Crypto '88, On generating solved instances of computational problems, Abadi, M., Allender, E., Broder, A., Feigenbaum, J. and Hemachandra, L. A.
  • Crypto '91, A calculus for access control in distributed systems, Abadi, M., Burrows, M., Lampson, B. and Plotkin, G.
    Adams, C. M.
  • Crypto '87, Security-related comments regarding McEliece's public-key cryptosystem, Adams, C. M. and Meijer, H.
  • Crypto '89, Good S-boxes are easy to find, Adams, C. M. and Tavares, S. E.
    Adleman, L. M.
  • Crypto '81, Primality Testing, Adleman, L. M.
  • Crypto '82, Implementing an electronic notary public, Adleman, L. M.
  • Crypto '82, On breaking the iterated Merkle-Hellman public-key cryptosystem, Adleman, L. M.
  • Crypto '85, Breaking the Ong-Schnorr-Shamir signature scheme for quadratic number fields, Estes, D., Adleman, L. M., Kompella, K., McCurley, K. S. and Miller, G. L.
  • Crypto '88, An abstract theory of computer viruses (invited talk), Adleman, L. M.
  • Crypto '90, Fast checkers for cryptography, Kompella, K. and Adleman, L. M.
  • Crypto '93, A subexponential algorithm for discrete logarithms over all finite fields, Adleman, L. M. and DeMarrais, J.
    Agnew, G. B.
  • Eurocrypt '84, Secrecy and privacy in the local area network environment, Agnew, G. B.
  • Eurocrypt '85, Modeling of encryption techniques for secrecy and privacy in multi-user networks., Agnew, G. B.
  • Eurocrypt '86, Another Look at Redundancy in Cryptographic Systems, Agnew, G. B.
  • Eurocrypt '87, Random sources for cryptographic systems, Agnew, G. B.
  • Eurocrypt '88, An interactive data exchange protocol based on discrete exponentiation, Agnew, G. B., Mullin, R. C. and Vanstone, S. A.
  • Eurocrypt '88, Fast exponentiation in GF(2n), Agnew, G. B., Mullin, R. C. and Vanstone, S. A.
  • Eurocrypt '89, A fast elliptic curve cryptosystem, Agnew, G. B., Mullin, R. C. and Vanstone, S. A.
  • Eurocrypt '92, On the development of a fast elliptic curve cryptosystem, Agnew, G. B., Mullin, R. C. and Vanstone, S. A.
    Aiello, W.
  • Eurocrypt '96, Foiling birthday attacks in length-doubling transformations, Aiello, W. and Venkatesan, R.
    Akl, S. G.
  • Crypto '81, Digital Signature Scheme for Computer Communication Networks, Meijer, H. and Akl, S. G.
  • Crypto '82, Cryptographic solution to a multilevel security problem, Akl, S. G. and Taylor, P. D.
  • Crypto '83, On the security of compressed encodings, Akl, S. G.
  • Crypto '84, A fast pseudo random permutation generator with applications to cryptology, Akl, S. G. and Meijer, H.
  • Eurocrypt '85, Two new secret key cryptosystems., Meijer, H. and Akl, S. G.
    Alexi, W.
  • Eurocrypt '84, RSA-bits are 0.5 + epsilon secure, Schnorr, C. P. and Alexi, W.
    Allender, E.
  • Crypto '88, On generating solved instances of computational problems, Abadi, M., Allender, E., Broder, A., Feigenbaum, J. and Hemachandra, L. A.
    Amirazizi, H.
  • Crypto '81, Time-Memory-Processor Tradeoffs, Amirazizi, H. and Hellman, M. E.
  • Crypto '81, Compact Knapsacks are Polynomially Solvable, Amirazizi, H., Karnin, E. and Reyneri, J. M.
    Anderson, D. P.
  • Eurocrypt '87, Highperformance interface architectures for cryptographic hardware, Anderson, D. P. and Venkat Rangan, P.
    Anderson, R.
  • Crypto '95, Robustness Principles for Public Key Protocols, Anderson, R. and Needham, R.
  • Eurocrypt '97, The GCHQ Protocol and Its Problems, Anderson, R. and Roe, M.
    Andreasen, E.
  • Eurocrypt '90, VICTOR - an efficient RSA hardware implementation, Orup, H., Svendsen, E. and Andreasen, E.
    Annick, M.
  • Crypto '89, How to explain zero-knowledge protocols to your children, Quisquater, J. J., Guillou, L. C., Annick, M. and Berson, T. A.
    Antoine, M.
  • Eurocrypt '89, Legal requirements facing new signature technology (invited), Antoine, M., Brakeland, Jean-Franc, Eloy, M. and Poullet, Y.
    Aoki, K.
  • Crypto '94, Linear cryptanalysis of the Fast Data Encipherment Algorithm, Ohta, K. and Aoki, K.
  • Crypto '95, Improving the Search Algorithm for the Best Linear Expression, Ohta, K., Moriai, S. and Aoki, K.
    Atici, M.
  • Crypto '96, Universal Hashing and Multiple Authentication, Atici, M. and Stinson, D. R.
    Aumann, Y.
  • Crypto '93, One message proof systems with known space verifiers, Aumann, Y. and Feige, U.
    Avis, G. M.
  • Crypto '82, Using data uncertainty to increase the crypto-complexity of simple private key enciphering schemes, Avis, G. M. and Tavares, S. E.
    Bach, E.
  • Crypto '88, Intractable problems in number theory (invited talk), Bach, E.
    Barbaroux, P.
  • Eurocrypt '92, Uniform results in polynomial-time security, Barbaroux, P.
    Baric, N.
  • Eurocrypt '97, Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees, Baric, N. and Pfitzmann, B.
    Baritaud, T.
  • Eurocrypt '92, FFT hashing is not collision-free, Baritaud, T., Gilbert, H. and Girault, M.
  • Crypto '92, On the security of the permuted kernel identification scheme, Baritaud, T., Campana, M., Chauvaud, P. and Gilbert, H.
    Barrett, P.
  • Crypto '86, Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor, Barrett, P.
  • Crypto '89, The smart diskette -- A universal user token and personal crypto-engine, Barrett, P. and Eisele, R.
    Bauer, F. L.
  • Eurocrypt '82, Cryptology-methods and maxims, Bauer, F. L.
    Bauspiess, F.
  • Eurocrypt '89, How to keep authenticity alive in a computer network, Bauspiess, F. and Knobloch, H.-J.
  • Eurocrypt '90, Inverting the pseudo exponentiation, Bauspiess, F., Knobloch, H.-J. and Wichmann, P.
    Bauval, Anne
  • Eurocrypt '86, Cryptanalysis of Pseudo-Random Number Sequences Generated by a Linear Recurrence of a Given Order, Bauval, Anne
    Baxter, M. S. J.
  • Eurocrypt '85, The role of encipherment services in distributed systems., Baxter, M. S. J. and Jones, R. W.
    Beale, M.
  • Eurocrypt '86, Properties of De Bruijn Sequences Generated by a Cross-Join Technique, Beale, M.
  • Eurocrypt '86, Public Key Encryption of Stream Ciphers, Buckley, D. D. and Beale, M.
  • Crypto '88, Aperiodic linear complexities of de Bruijn sequences, Kwok, R. T. C. and Beale, M.
    Beauchemin, P.
  • Crypto '86, Two observations on probabilistic primality testing, Beauchemin, P., Brassard, G., Crépeau, C. and Goutier, C.
  • Crypto '87, A generalization of Hellman's extension of Shannon's approach to cryptography, Beauchemin, P. and Brassard, G.
    Beaver, D.
  • Crypto '89, Multiparty protocols tolerating half faulty processors, Beaver, D.
  • Crypto '89, Multiparty computation with faulty majority, Beaver, D. and Goldwasser, S.
  • Crypto '90, Security with low communication overhead (Extended abstract), Beaver, D., Feigenbaum, J., Kilian, J. and Rogaway, P.
  • Crypto '90, Hiding instances in zero-knowledge proof systems (Extended abstract), Beaver, D., Feigenbaum, J. and Shoup, V.
  • Crypto '91, Foundations of secure interactive computing, Beaver, D.
  • Crypto '91, Efficient multiparty protocols using circuit randomization, Beaver, D.
  • Eurocrypt '92, How to break a "secure" oblivious transfer protocol, Beaver, D.
  • Eurocrypt '92, Cryptographic protocols provably secure against dynamic adversaries, Beaver, D. and Haber, S.
  • Eurocrypt '93, Global, unpredictable bit generation without broadcast, Beaver, D. and So, N.
  • Crypto '95, Precomputing Oblivious Transfer, Beaver, D.
  • Eurocrypt '96, Equivocable oblivious transfer, Beaver, D.
  • Crypto '97, Plug and Play Encryption, Beaver, D.
    Beguin, P.
  • Eurocrypt '95, General short computational secret sharing schemes, Beguin, P. and Cresti, A.
  • Crypto '95, Fast Server-Aided RSA Signatures Secure Against Active Attacks, Beguin, P. and Quisquater, J. J.
    Beimel, A.
  • Crypto '92, Universally ideal secret sharing schemes (preliminary version), Beimel, A. and Chor, B.
  • Crypto '93, Interaction in key distribution schemes, Beimel, A. and Chor, B.
  • Crypto '95, Secret Sharing with Public Reconstruction, Beimel, A. and Chor, B.
    Beker, H. J.
  • Crypto '81, Nonlinear Feedback Shift Register Sequences, Beker, H. J.
  • Eurocrypt '82, Analog speech security systems, Beker, H. J.
  • Crypto '84, Key management for secure electronic funds transfer in a retail environment, Beker, H. J. and Walker, M.
  • Eurocrypt '87, Message authentication and dynamic passwords, Beker, H. J. and Cole, G. M.
    Bellare, M.
  • Crypto '88, How to sign given any trapdoor function, Bellare, M. and Micali, S.
  • Crypto '89, New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs, Bellare, M. and Goldwasser, S.
  • Crypto '89, Non-interactive oblivious transfer and applications, Bellare, M. and Micali, S.
  • Crypto '89, On the structure of secret key exchange protocols, Bellare, M., Cowen, L. and Goldwasser, S.
  • Crypto '92, On defining proofs of knowledge, Bellare, M. and Goldreich, O.
  • Crypto '92, Certifying cryptographic tools: The case of trapdoor permutations, Bellare, M. and Yung, M.
  • Crypto '93, Entity authentication and key distribution, Bellare, M. and Rogaway, P.
  • Eurocrypt '94, Optimal asymmetric encryption, Bellare, M. and Rogaway, P.
  • Crypto '94, Incremental cryptography: the case of hashing and signing, Bellare, M., Goldreich, O. and Goldwasser, S.
  • Crypto '94, The security of cipher block chaining, Bellare, M., Kilian, J. and Rogaway, P.
  • Crypto '95, XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions, Bellare, M., Guerin, R. and Rogaway, P.
  • Eurocrypt '96, The exact security of digital signatures how to sign with RSA and Rabin, Bellare, M. and Rogaway, P.
  • Crypto '96, Keying Hash Functions for Message Authentication, Bellare, M., Canetti, R. and Krawczyk, H.
  • Eurocrypt '97, A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost, Bellare, M. and Micciancio, D.
  • Eurocrypt '97, Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function, Bellare, M., Jakobsson, M. and Yung, M.
  • Crypto '97, "Pseudo-Random" Number Generation within Cryptographic Algorithms: The DSS Case, Bellare, M., Goldwasser, S. and Micciancio, D.
  • Crypto '97, Collision-Resistant Hashing: Towards Making UOWHFs Practical, Bellare, M. and Rogaway, P.
    Beller, M. J.
  • Eurocrypt '92, Batch Diffie-Hellman key agreement systems and their application to portable communications, Beller, M. J. and Yacobi, Y.
    Ben Aroya, I.
  • Crypto '93, Differential cryptanalysis of Lucifer, Ben Aroya, I. and Biham, E.
    Ben-Or, M.
  • Crypto '88, Everything provable is provable in zero-knowledge, Ben-Or, M., Goldreich, O., Goldwasser, S., Hastad, J., Kilian, J., Micali, S. and Rogaway, P.
  • Crypto '89, Efficient identification schemes using two prover interactive proofs, Ben-Or, M., Goldwasser, S., Kilian, J. and Wigderson, A.
    Benaloh, J.
  • Crypto '88, Generalized secret sharing and monotone functions, Benaloh, J. and Leichter, J.
  • Eurocrypt '93, One-way accumulators: A decentralized alternative to digital signatures, Benaloh, J. and Mare, M. de
    Bender, A.
  • Crypto '89, On the implementation of elliptic curve cryptosystems, Bender, A. and Castagnoli, G.
    Bengio, S.
  • Crypto '87, Special uses and abuses of the Fiat Shamir passport protocol, Desmedt, Y., Goutier, C. and Bengio, S.
    Bennett, C. H.
  • Crypto '82, Quantum cryptography, or unforgeable subway tokens, Bennett, C. H., Brassard, G., Breidbart, S. and Wiesner, S.
  • Crypto '84, An update on quantum cryptography, Bennett, C. H. and Brassard, G.
  • Crypto '85, How to reduce your enemy's information, Bennett, C. H., Brassard, G. and Robert, J. M.
  • Eurocrypt '90, Experimental quantum cryptography, Bennett, C. H., Bessette, F., Brassard, G., Salvail, L. and Smolin, J.
  • Crypto '91, Practical quantum oblivious transfer, Bennett, C. H., Brassard, G., Crépeau, C. and Skubiszewska, M. H.
    Berger, R.
  • Eurocrypt '84, A provably secure oblivious transfer protocol, Berger, R., Peralta, R. and Tedrick, T.
  • Crypto '85, A framework for the study of cryptographic protocols, Berger, R., Kannan, S. and Peralta, R.
    Berkovits, S.
  • Crypto '83, Probabilistic analysis and performance modelling of the "Swedish" algorithm and modifications, Sachs, J. E. and Berkovits, S.
  • Eurocrypt '91, How to broadcast a secret, Berkovits, S.
    Bernasconi, J.
  • Eurocrypt '85, Analysis of a nonlinear feedforward logic for binary sequence generators., Bernasconi, J. and Guenther, C. G.
    Berson, T. A.
  • Crypto '81, Local Network Cryptosystem Architecture, Berson, T. A.
  • Crypto '82, Local network cryptosystem architecture: access control, Berson, T. A.
  • Crypto '82, Long key variants of DES, Berson, T. A.
  • Crypto '89, How to explain zero-knowledge protocols to your children, Quisquater, J. J., Guillou, L. C., Annick, M. and Berson, T. A.
  • Eurocrypt '92, Differential cryptanalysis mod 232 with applications to MD5, Berson, T. A.
  • Crypto '97, Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack, Berson, T. A.
    Bertilsson, M.
  • Eurocrypt '89, Cryptanalysis of video encryption based on space-filling curves, Bertilsson, M., Brickell, E. F. and Ingemarsson, I.
    Bessette, F.
  • Eurocrypt '90, Experimental quantum cryptography, Bennett, C. H., Bessette, F., Brassard, G., Salvail, L. and Smolin, J.
    Beth, T.
  • Eurocrypt '82, Introduction, Beth, T.
  • Eurocrypt '84, The stop-and-go generator, Beth, T. and Piper, F.
  • Crypto '86, Architectures for exponentiation in GF(2n), Beth, T., Cook, B. M. and Gollmann, D.
  • Eurocrypt '87, Some remarks on the cross correlation analysis of pseudo random generators, Mund, S., Gollmann, D. and Beth, T.
  • Eurocrypt '88, Efficient zero-knowledged identification scheme for smart cards, Beth, T.
  • Eurocrypt '89, On the Complexity of Pseudo-Random Sequences - or: If you Can Describe a Sequence It Can't be Random, Beth, T. and Dai, Z.
  • Eurocrypt '90, Lower bounds for the linear complexity of sequences over residue rings, Dai, Z., Beth, T. and Gollmann, D.
  • Crypto '90, Identification tokens -- or: Solving the chess grandmaster problem, Beth, T. and Desmedt, Y.
  • Eurocrypt '91, Non supersingular elliptic curves for public key cryptosystems, Beth, T. and Schaefer, F.
  • Eurocrypt '93, On almost perfect nonlinear permutations, Beth, T. and Ding, C.
  • Crypto '94, Cryptanalysis of cryptosystems based on remote chaos replication, Beth, T., Lazic, D. E. and Mathias, A.
    Beutelspacher, A.
  • Eurocrypt '86, Geometric Structures as Threshold Schemes, Beutelspacher, A.
  • Eurocrypt '87, Perfect and essentially perfect authentication schemes, Beutelspacher, A.
  • Eurocrypt '89, How to say "no", Beutelspacher, A.
  • Eurocrypt '90, Essentially l-fold secure authentication systems, Beutelspacher, A. and Rosenbaum, U.
    Biehl, I.
  • Eurocrypt '92, Tools for proving zero knowledge, Biehl, I., Buchmann, J. A., Meyer, B., Thiel, C. and Thiel, C.
  • Crypto '94, Cryptographic protocols based on discrete logarithms in real-quadratic orders, Biehl, I., Buchmann, J. A. and Thiel, C.
    Bierbrauer, J.
  • Crypto '93, On families of hash functions via geometric codes and concatenation, Bierbrauer, J., Johansson, T., Kabatianski, G. A. and Smeets, B.
  • Crypto '94, Bounds for resilient functions and orthogonal arrays, Bierbrauer, J., Gopalakrishnan, K. and Stinson, D. R.
  • Eurocrypt '95, A2-codes from universal hash classes, Bierbrauer, J.
    Bierens, L.
  • Eurocrypt '86, Additional Properties in the S-Boxes of the DES, Cloetens, H., Bierens, L., Vandewalle, J. and Govaerts, R.
    Biham, E.
  • Crypto '90, Differential cryptanalysis of DES-like cryptosystems (Extended abstract), Biham, E. and Shamir, A.
  • Eurocrypt '91, Differential cryptanalysis of Feal and N-Hash, Biham, E. and Shamir, A.
  • Eurocrypt '91, Cryptanalysis of the chaotic-map cryptosystem suggested at EUROCRYPT'91, Biham, E.
  • Crypto '91, Differential cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer (Extended abstract), Biham, E. and Shamir, A.
  • Crypto '92, Differential cryptanalysis of the full 16-round DES, Biham, E. and Shamir, A.
  • Eurocrypt '93, New types of cryptanalytic attacks using related keys, Biham, E.
  • Crypto '93, Differential cryptanalysis of Lucifer, Ben Aroya, I. and Biham, E.
  • Eurocrypt '94, On Matsui's linear cryptanalysis, Biham, E.
  • Eurocrypt '94, An improvement of Davies' attack on DES, Biham, E. and Biryukov, A.
  • Crypto '97, Differential Fault Analysis of Secret Key Cryptosystems, Biham, E. and Shamir, A.
    Bird, G. J.
  • Eurocrypt '86, Encryption Exponent 3 and the Security of RSA, Khoo, D. S. P., Bird, G. J. and Seberry, J.
    Bird, R.
  • Crypto '91, Systematic design of two-party authentication protocols, Bird, R., Gopal, I., Herzberg, A., Janson, P., Kutten, S., Molva, R. and Yung, M.
    Biryukov, A.
  • Eurocrypt '94, An improvement of Davies' attack on DES, Biham, E. and Biryukov, A.
    Blackburn, S. R.
  • Eurocrypt '93, Weaknesses of a public-key cryptosystem based on factorizations of finite groups, Blackburn, S. R., Murphy, S. and Stern, J.
  • Eurocrypt '96, Efficient multiplicative sharing schemes, Blackburn, S. R., Burmester, M. V. D., Desmedt, Y. and Wild, R. P.
    Blake, I. F.
  • Crypto '84, Computing logarithms in GF(2n), Blake, I. F., Mullin, R. C. and Vanstone, S. A.
    Blakley, B.
  • Crypto '92, Threshold schemes with disenrollment, Blakley, B., Blakley, G. R., Chan, A. H. and Massey, J. L.
    Blakley, G. R.
  • Crypto '81, Key Management from a Security Viewpoint, Blakley, G. R.
  • Crypto '82, Infinite structures in information theory, Blakley, G. R. and Swanson, L.
  • Crypto '84, Security of ramp schemes, Blakley, G. R. and Meadows, C.
  • Crypto '84, Information theory without the finiteness assumption, I: Cryptosystems as group-theoretic objects, Blakley, G. R.
  • Crypto '85, Fingerprinting long forgiving messages, Blakley, G. R., Meadows, C. and Purdy, G. B.
  • Crypto '85, Information theory without the finiteness assumption, II unfolding the DES, Blakley, G. R.
  • Crypto '86, Smallest possible message expansion in threshold schemes, Blakley, G. R. and Dixon, R. D.
  • Crypto '87, Cryptosystems based on an analog of heat flow, Blakley, G. R. and Rundell, W.
  • Crypto '92, Threshold schemes with disenrollment, Blakley, B., Blakley, G. R., Chan, A. H. and Massey, J. L.
  • Crypto '95, On General Perfect Secret Sharing Schemes, Blakley, G. R. and Kabatianski, G. A.
    Bleichenbacher, D.
  • Crypto '94, Directed acyclic graphs, one-way functions and digital signatures, Bleichenbacher, D. and Maurer, U. M.
  • Crypto '95, Some Remarks on Lucas-Based Cryptosystems, Bleichenbacher, D., Bosma, W. and Lenstra, A. K.
  • Eurocrypt '96, Generating ElGamal signatures without knowing the secret key, Bleichenbacher, D.
  • Crypto '97, On the Security of the KMOV Public Key Cryptosystem, Bleichenbacher, D.
    Bleumer, G.
  • Eurocrypt '90, A remark on signature scheme where forgery can be proved, Bleumer, G., Pfitzmann, B. and Waidner, M.
    Blom, R.
  • Crypto '82, Non-public key distribution, Blom, R.
  • Eurocrypt '84, An optimal class of symmetric key generation systems, Blom, R.
    Blum, A.
  • Crypto '93, Cryptographic primitives based on hard learning problems, Blum, A., Furst, M., Kearns, M. and Lipton, R. J.
    Blum, L.
  • Crypto '82, Comparison of two pseudo-random number generators, Blum, L., Blum, M. and Shub, M.
    Blum, M.
  • Crypto '81, Coin Flipping by Telephone, Blum, M.
  • Crypto '82, Comparison of two pseudo-random number generators, Blum, L., Blum, M. and Shub, M.
  • Crypto '83, Reducibility among protocols, Blum, M., Vazirani, U. V. and Vazirani, V. V.
  • Crypto '84, An efficient probabilistic public key encryption scheme which hides all partial information, Blum, M. and Goldwasser, S.
  • Crypto '88, Proving security against chosen cyphertext attacks, Blum, M., Feldman, P. and Micali, S.
    Blundo, C.
  • Eurocrypt '92, Graph decompositions and secret sharing schemes, Blundo, C., De Santis, A., Stinson, D. R. and Vaccaro, U.
  • Crypto '92, On the information rate of secret sharing schemes, Blundo, C., De Santis, A., Gargano, L. and Vaccaro, U.
  • Crypto '92, Perfectly-secure key distribution for dynamic conferences, Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U. and Yung, M.
  • Crypto '93, Fully dynamic secret sharing schemes, Blundo, C., Cresti, A., De Santis, A. and Vaccaro, U.
  • Eurocrypt '94, On the dealer's randomness required in secret sharing schemes, Blundo, C., Giorgio Gaggia, A. and Stinson, D. R.
  • Eurocrypt '94, Space requirements for broadcast encryption, Blundo, C. and Cresti, A.
  • Crypto '94, Multi-secret sharing schemes, Blundo, C., De Santis, A., Di Crescenzo, G., Gaggia, A. Giorgio and Vaccaro, U.
  • Crypto '96, Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution, Blundo, C., Mattos, L. A. F. and Stinson, D. R.
    Boekee, D. E.
  • Crypto '85, Divergence bounds on key equivocation and error probability in cryptanalysis, van Tilburg, J. and Boekee, D. E.
  • Eurocrypt '87, Modes of blockcipher algorithms and their protection against active eavesdropping, Jansen, C. J. A. and Boekee, D. E.
  • Crypto '89, The shortest feedback shift register that can generate a given sequence, Jensen, C. J. A. and Boekee, D. E.
    Boneh, D.
  • Crypto '95, Quantum Cryptanalysis of Hidden Linear Functions, Boneh, D. and Lipton, R. J.
  • Crypto '95, Collusion-Secure Fingerprinting for Digital Data, Boneh, D. and Shaw, J.
  • Crypto '96, Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes, Boneh, D. and Venkatesan, R.
  • Crypto '96, Algorithms for Black-Box Fields and Their Application to Cryptography, Boneh, D. and Lipton, R. J.
  • Eurocrypt '97, On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract), Boneh, D., DeMillo, R. A. and Lipton, R. J.
  • Crypto '97, Efficient Generation of Shared RSA Keys, Boneh, D. and Franklin, M. K.
    Book, R. V.
  • Eurocrypt '85, The verifiability of two-party protocols., Book, R. V. and Otto, F.
    Borst, J.
  • Eurocrypt '97, Two Attacks on Reduced IDEA (Extended Abstract), Borst, J., Knudsen, L. R. and Rijmen, V.
    Bos, J. N. E.
  • Eurocrypt '89, Detection of disrupters in the DC protocol, Bos, J. N. E. and den Boer, B.
  • Crypto '89, Addition chain heuristics, Bos, J. N. E. and Coster, M. J.
  • Crypto '92, Provably unforgeable signatures, Bos, J. N. E. and Chaum, D.
    Bosma, W.
  • Eurocrypt '89, Faster primality testing (extended abstract), Bosma, W. and van der Hulst, M. P.
  • Crypto '95, Some Remarks on Lucas-Based Cryptosystems, Bleichenbacher, D., Bosma, W. and Lenstra, A. K.
    Bosselaers, A.
  • Crypto '89, A chosen text attack on the modified cryptographic checksum algorithm of Cohen and Huang, Preneel, B., Bosselaers, A., Govaerts, R. and Vandewalle, J.
  • Crypto '91, An attack on the last two rounds of MD4, den Boer, B. and Bosselaers, A.
  • Eurocrypt '93, Collisions for the compression function of MD-5, den Boer, B. and Bosselaers, A.
  • Crypto '93, Comparison of three modular reduction functions, Bosselaers, A., Govaerts, R. and Vandewalle, J.
  • Crypto '96, Fast Hashing on the Pentium, Bosselaers, A., Govaerts, R. and Vandewalle, J.
  • Eurocrypt '97, SHA: A Design for Parallel Architectures?, Bosselaers, A., Govaerts, R. and Vandewalle, J.
    Bouckaert, A.
  • Eurocrypt '84, Security of transportable computerized files, Bouckaert, A.
  • Eurocrypt '89, Zero-knowledge procedures for confidential access to medical records, Quisquater, J. J. and Bouckaert, A.
    Boyar, J.
  • Eurocrypt '89, Practical zero-knowledge proofs: Giving hints and using deficiencies, Boyar, J., Friedl, K. and Lund, C.
  • Crypto '89, On the concrete complexity of zero-knowledge proofs, Boyar, J. and Peralta, R.
  • Crypto '90, Convertible undeniable signatures, Boyar, J., Chaum, D., Damgård, I. B. and Pedersen, T. P.
  • Eurocrypt '96, Short discreet proofs, Boyar, J. and Peralta, R.
    Boyd, C.
  • Eurocrypt '88, Some applications of multiple key ciphers, Boyd, C.
  • Eurocrypt '89, A new multiple key cipher and an improved voting scheme, Boyd, C.
  • Eurocrypt '91, Enhancing secrecy by data compression: Theoretical and practical aspects, Boyd, C.
  • Eurocrypt '93, On a limitation of BAN logic, Boyd, C. and Mao, W.
    Bradey, R. L.
  • Eurocrypt '85, Full encryption in a personal computer system., Bradey, R. L. and Graham, I. G.
    Brakeland, Jean-Franc
  • Eurocrypt '89, Legal requirements facing new signature technology (invited), Antoine, M., Brakeland, Jean-Franc, Eloy, M. and Poullet, Y.
    Brand, R. L.
  • Crypto '89, Problems with the normal use of cryptography for providing security on unclassified networks (invited), Brand, R. L.
    Brands, S.
  • Eurocrypt '93, Distance bounding protocols, Brands, S. and Chaum, D.
  • Crypto '93, Untraceable off-line cash in wallets with observers, Brands, S.
  • Eurocrypt '95, Restrictive blinding of secret-key certificates, Brands, S.
  • Eurocrypt '97, Rapid Demonstration of Linear Relations Connected by Boolean Operators, Brands, S.
    Brandt, J.
  • Eurocrypt '88, Anonymous and verifiable registration in databases, Brandt, J., Damgård, I. B. and Landrock, P.
  • Crypto '88, Zero-knowledge authentication scheme with secret key exchange, Brandt, J., Damgård, I. B., Landrock, P. and Pedersen, T. P.
  • Crypto '92, On generation of probable primes by incremental search, Brandt, J. and Damgård, I. B.
    Branstad, D. K.
  • Crypto '92, Response to comments on the NIST proposed Digital Signature Standard, Smid, M. E. and Branstad, D. K.
    Brassard, G.
  • Crypto '81, An Optimally Secure Relativized Cryptosystem, Brassard, G.
  • Crypto '82, On computationally secure authentication tags requiring short secret shared keys, Brassard, G.
  • Crypto '82, Quantum cryptography, or unforgeable subway tokens, Bennett, C. H., Brassard, G., Breidbart, S. and Wiesner, S.
  • Crypto '84, An update on quantum cryptography, Bennett, C. H. and Brassard, G.
  • Crypto '85, How to reduce your enemy's information, Bennett, C. H., Brassard, G. and Robert, J. M.
  • Crypto '86, Zero-knowledge simulation of Boolean circuits, Brassard, G. and Crépeau, C.
  • Crypto '86, All-or-nothing disclosure of secrets, Brassard, G., Crépeau, C. and Robert, J. M.
  • Crypto '86, Two observations on probabilistic primality testing, Beauchemin, P., Brassard, G., Crépeau, C. and Goutier, C.
  • Crypto '87, A generalization of Hellman's extension of Shannon's approach to cryptography, Beauchemin, P. and Brassard, G.
  • Crypto '88, "Practical IP" < MA, Brassard, G. and Damgård, I. B.
  • Eurocrypt '89, How to improve signature schemes, Brassard, G.
  • Eurocrypt '89, Sorting out zero-knowledge, Brassard, G. and Crépeau, C.
  • Eurocrypt '89, Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract), Brassard, G., Crépeau, C. and Yung, M.
  • Eurocrypt '90, Experimental quantum cryptography, Bennett, C. H., Bessette, F., Brassard, G., Salvail, L. and Smolin, J.
  • Crypto '90, Quantum bit commitment and coin tossing protocols, Brassard, G. and Crépeau, C.
  • Crypto '90, One-way group actions, Brassard, G. and Yung, M.
  • Crypto '91, Practical quantum oblivious transfer, Bennett, C. H., Brassard, G., Crépeau, C. and Skubiszewska, M. H.
  • Eurocrypt '93, Secret key reconciliation by public discussion, Brassard, G. and Salvail, L.
  • Eurocrypt '97, Oblivious Transfers and Privacy Amplification, Brassard, G. and Crépeau, C.
  • Crypto '97, Quantum Information Processing: The Good, the Bad and the Ugly, Brassard, G.
    Breidbart, S.
  • Crypto '82, Quantum cryptography, or unforgeable subway tokens, Bennett, C. H., Brassard, G., Breidbart, S. and Wiesner, S.
    Brickell, E. F.
  • Crypto '82, Some remarks on the Herlestam-Johannesson algorithm for computing logarithms over GF(2p), Brickell, E. F. and Moore, J. H.
  • Crypto '82, A fast modular multiplication algorithm with applications to two key cryptography, Brickell, E. F.
  • Crypto '82, A preliminary report on the cryptanalysis of Merkle-Hellman knapsack cryptosystems, Brickell, E. F., Davis, J. A. and Simmons, G. J.
  • Crypto '83, Solving low density knapsacks, Brickell, E. F.
  • Crypto '83, Evaluation of the Adleman attack on multiply iterated knapsack cryptosystems, Brickell, E. F., Lagarias, J. C. and Odlyzko, A. M.
  • Crypto '84, Breaking iterated knapsacks, Brickell, E. F.
  • Crypto '85, An attack on a signature scheme proposed by Okamoto and Shiraishi, Brickell, E. F. and DeLaurentis, J. M.
  • Eurocrypt '86, Cryptanalysis of the Yagisawa Public Key Cryptosystem, Brickell, E. F.
  • Crypto '86, Structure in the S-boxes of the DES, Brickell, E. F., Moore, J. H. and Purtill, M. R.
  • Eurocrypt '87, On privacy homomorphisms, Brickell, E. F. and Yacobi, Y.
  • Crypto '87, Gradual and verifiable release of a secret, Brickell, E. F., Chaum, D., Damgård, I. B. and van de Graaf, J.
  • Crypto '87, Secure audio teleconference, Brickell, E. F., Lee, P. J. and Yacobi, Y.
  • Eurocrypt '88, Authentication codes with multiple arbiters, Brickell, E. F. and Stinson, D. R.
  • Eurocrypt '88, An observation on the security of McEliece's public-key cryptosystem, Lee, P. J. and Brickell, E. F.
  • Crypto '88, The detection of cheaters in threshold schemes, Brickell, E. F. and Stinson, D. R.
  • Eurocrypt '89, Cryptanalysis of video encryption based on space-filling curves, Bertilsson, M., Brickell, E. F. and Ingemarsson, I.
  • Eurocrypt '89, Some ideal secret sharing schemes, Brickell, E. F.
  • Crypto '89, On the classification of ideal secret sharing schemes (extended abstract), Brickell, E. F. and Davenport, D. M.
  • Crypto '89, A survey of hardware implementations of RSA (invited), Brickell, E. F.
  • Eurocrypt '90, An interactive identification scheme based on discrete logarithms and factoring (extended abstract), Brickell, E. F. and McCurley, K. S.
  • Crypto '90, Some improved bounds on the information rate of perfect secret sharing schemes (Extended abstract), Brickell, E. F. and Stinson, D. R.
  • Eurocrypt '92, Fast exponentiation with precomputation (Extended abstract), Brickell, E. F., Gordon, D. M., McCurley, K. S. and Wilson, D. B.
    Broder, A.
  • Crypto '88, On generating solved instances of computational problems, Abadi, M., Allender, E., Broder, A., Feigenbaum, J. and Hemachandra, L. A.
    Brookson, C. B.
  • Eurocrypt '84, Encryption and key management for the ECS satellite service, Serpell, S. C. and Brookson, C. B.
  • Crypto '84, A prototype encryption system using public key, Serpell, S. C., Brookson, C. B. and Clark, B. L.
    Broscius, A. G.
  • Crypto '91, Exploiting parallelism in hardware implementation of the DES, Broscius, A. G. and Smith, J. M.
    Brown, L.
  • Eurocrypt '89, On the design of permutation P in DES type cryptosystems, Brown, L. and Seberry, J.
    Brugia, O.
  • Eurocrypt '84, An encryption and authentication procedure for tele-surveillance systems, Wolfowicz, W., Brugia, O. and Improta, S.
    Brynielsson, L.
  • Eurocrypt '85, On the linear complexity of combined shift register sequences., Brynielsson, L.
  • Eurocrypt '91, The information leakage through a randomly generated function, Brynielsson, L.
    Buchmann, J. A.
  • Eurocrypt '89, On the complexity and efficiency of a new key exchange system, Buchmann, J. A., Duellmann, S. and Williams, H. C.
  • Crypto '89, A key exchange system based on real quadratic fields, Buchmann, J. A. and Williams, H. C.
  • Eurocrypt '90, Implementation of a key exchange protocol using real quadratic fields (extended abstract), Scheidler, R., Buchmann, J. A. and Williams, H. C.
  • Crypto '90, On the computation of discrete logarithms in class groups (Extended abstract), Buchmann, J. A. and Duellmann, S.
  • Eurocrypt '92, Tools for proving zero knowledge, Biehl, I., Buchmann, J. A., Meyer, B., Thiel, C. and Thiel, C.
  • Crypto '93, An implementation of the general number field sieve, Buchmann, J. A., Loho, J. and Zayer, J.
  • Crypto '94, Cryptographic protocols based on discrete logarithms in real-quadratic orders, Biehl, I., Buchmann, J. A. and Thiel, C.
  • Crypto '97, A One Way Function Based on Ideal Arithmetic in Number Fields, Buchmann, J. A. and Paulus, S.
    Buckley, D. D.
  • Eurocrypt '86, Public Key Encryption of Stream Ciphers, Buckley, D. D. and Beale, M.
    Buelens, J.
  • Crypto '93, Cryptanalysis of the CFB mode of the DES with a reduced number of rounds, Preneel, B., Nuttin, M., Rijmen, V. and Buelens, J.
    Burmester, M. V. D.
  • Eurocrypt '89, A general zero-knowledge scheme, Burmester, M. V. D., Desmedt, Y., Piper, F. and Walker, M.
  • Eurocrypt '90, All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions (extended abstract), Burmester, M. V. D. and Desmedt, Y.
  • Eurocrypt '90, A remark on efficiency of identification schemes, Burmester, M. V. D.
  • Eurocrypt '91, Broadcast interactive proofs, Burmester, M. V. D. and Desmedt, Y.
  • Crypto '92, Non-existence of homomorphic general sharing schemes for some key spaces, Frankel, Y., Desmedt, Y. and Burmester, M. V. D.
  • Eurocrypt '93, Cryptanalysis of the Chang-Wu-Chen key distribution system, Burmester, M. V. D.
  • Eurocrypt '94, A secure and efficient conference key distribution system, Burmester, M. V. D. and Desmedt, Y.
  • Crypto '94, On the risk of opening distributed keys, Burmester, M. V. D.
  • Eurocrypt '96, Homomorphisms of secret sharing schemes: a tool for verifiable signature sharing, Burmester, M. V. D.
  • Eurocrypt '96, Efficient multiplicative sharing schemes, Blackburn, S. R., Burmester, M. V. D., Desmedt, Y. and Wild, R. P.
    Burrows, M.
  • Crypto '91, A calculus for access control in distributed systems, Abadi, M., Burrows, M., Lampson, B. and Plotkin, G.
    Cachin, C.
  • Eurocrypt '94, Linking information reconciliation and privacy amplification, Cachin, C. and Maurer, U. M.
  • Eurocrypt '97, Smooth Entropy and Renyi Entropy, Cachin, C.
  • Crypto '97, Unconditional Security Against Memory-Bounded Adversaries, Cachin, C. and Maurer, U. M.
    Cade, J. J.
  • Crypto '86, A modification of a broken public-key cipher, Cade, J. J.
    Cain, M. R.
  • Eurocrypt '85, Using algorithms as keys in stream ciphers., Wagner, N. R., Putter, P. S. and Cain, M. R.
  • Crypto '86, Large-scale randomization techniques, Wagner, N. R., Putter, P. S. and Cain, M. R.
    Camenisch, J. L.
  • Eurocrypt '94, Blind signatures based on the discrete logarithm problem, Camenisch, J. L., Piveteau, J. M. and Stadler, M. A.
  • Eurocrypt '95, Fair blind signatures, Stadler, M. A., Piveteau, J. M. and Camenisch, J. L.
  • Eurocrypt '97, Efficient and Generalized Group Signatures, Camenisch, J. L.
  • Crypto '97, Efficient Group Signature Schemes for Large Groups, Camenisch, J. L. and Stadler, M. A.
    Camion, P.
  • Eurocrypt '88, Manipulations and errors, detection and localization, Godlewski, P. and Camion, P.
  • Eurocrypt '91, The knapsack hash function proposed at Crypto'89 can be broken, Camion, P. and Patarin, J.
  • Crypto '91, On correlation-immune functions, Camion, P., Carlet, C., Charpin, P. and Sendrier, N.
  • Eurocrypt '96, Construction of t-resilient functions over a finite alphabet, Camion, P. and Canteaut, A.
  • Crypto '96, Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations, Camion, P. and Canteaut, A.
    Campana, M.
  • Crypto '92, On the security of the permuted kernel identification scheme, Baritaud, T., Campana, M., Chauvaud, P. and Gilbert, H.
    Campbell, K. W.
  • Crypto '92, DES is not a group, Campbell, K. W. and Wiener, M. J.
    Canetti, R.
  • Crypto '94, Maintaining security in the presence of transient faults, Canetti, R. and Herzberg, A.
  • Crypto '96, Keying Hash Functions for Message Authentication, Bellare, M., Canetti, R. and Krawczyk, H.
  • Crypto '97, Deniable Encryption, Canetti, R., Dwork, C., Naor, M. and Ostrovsky, R.
  • Crypto '97, Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information, Canetti, R.
    Canteaut, A.
  • Eurocrypt '96, Construction of t-resilient functions over a finite alphabet, Camion, P. and Canteaut, A.
  • Crypto '96, Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations, Camion, P. and Canteaut, A.
    Capocelli, R. M.
  • Crypto '91, On the size of shares for secret sharing schemes, Capocelli, R. M., De Santis, A., Gargano, L. and Vaccaro, U.
    Carlet, C.
  • Crypto '91, On correlation-immune functions, Camion, P., Carlet, C., Charpin, P. and Sendrier, N.
  • Crypto '92, Partially-bent functions, Carlet, C.
  • Eurocrypt '93, Two new classes of bent functions, Carlet, C.
  • Eurocrypt '97, More Correlation-Immune and Reslient Functions over Galois Fields and Galois Rings, Carlet, C.
    Carpentieri, M.
  • Eurocrypt '93, Size of shares and probability of cheating in threshold schemes, Carpentieri, M., De Santis, A. and Vaccaro, U.
    Carter, G.
  • Eurocrypt '89, Some conditions on the linear complexity profiles of certain binary sequences, Carter, G.
    Castagnoli, G.
  • Crypto '89, On the implementation of elliptic curve cryptosystems, Bender, A. and Castagnoli, G.
    Chabaud, F.
  • Eurocrypt '94, On the security of some cryptosystems based on error-correcting codes, Chabaud, F.
  • Eurocrypt '94, Links between differential and linear cryptanalysis, Chabaud, F. and Vaudenay, S.
    Chambers, W. G.
  • Eurocrypt '88, Windmill generators: A generalization and an observation of how many there are, Smeets, B. and Chambers, W. G.
  • Eurocrypt '88, Lock-in effect in cascades of clock-controlled shift-registers, Chambers, W. G. and Gollmann, D.
  • Eurocrypt '89, A cryptanalysis of Stepk,m-cascades, Gollmann, D. and Chambers, W. G.
  • Eurocrypt '91, On binary sequences from recursions "modulo 2e" made non-linear by the bit-by-bit "xor" function, Chambers, W. G.
    Chan, A. H.
  • Crypto '86, On the linear span of binary sequences obtained from finite geometries, Chan, A. H. and Games, R. A.
  • Eurocrypt '89, On the linear complexity of feedback registers (extended abstract), Chan, A. H., Goresky, M. and Klapper, A.
  • Crypto '89, On the quadratic spans of periodic sequences, Chan, A. H. and Games, R. A.
  • Eurocrypt '90, Correlation functions of geometric sequences, Chan, A. H., Goresky, M. and Klapper, A.
  • Crypto '92, Threshold schemes with disenrollment, Blakley, B., Blakley, G. R., Chan, A. H. and Massey, J. L.
    Chao, J.
  • Crypto '91, A new ID-based key sharing system, Tsujii, S. and Chao, J.
  • Crypto '94, Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks, Chao, J., Tanada, K. and Tsujii, S.
    Charnes, C.
  • Eurocrypt '94, Comments on Soviet encryption algorithm, Charnes, C., O'Connor, L., Pieprzyk, J., Safavi-Naini, R. and Zheng, Y.
    Charpin, P.
  • Crypto '91, On correlation-immune functions, Camion, P., Carlet, C., Charpin, P. and Sendrier, N.
    Chasse, G.
  • Crypto '90, A statistical attack of the FEAL cryptosystem, Gilbert, H. and Chasse, G.
    Chaum, D.
  • Crypto '81, Verification by Anonymous Monitors (also known as Silo Watching), Chaum, D.
  • Crypto '82, Blind signatures for untraceable payments, Chaum, D.
  • Crypto '83, Blind signature system, Chaum, D.
  • Crypto '83, Design concepts for tamper responding systems, Chaum, D.
  • Crypto '84, New secret codes can prevent a computerized big brother, Chaum, D.
  • Crypto '84, How to keep a secret alive: extensible partial key, key safeguarding, and threshold systems, Chaum, D.
  • Eurocrypt '85, Showing credentials without identification. Signatures transferred between unconditionally unlinkable pseudonyms., Chaum, D.
  • Crypto '85, Attacks on some RSA signatures, de Jonge, W. and Chaum, D.
  • Crypto '85, Cryptanalysis of DES with a reduced number of rounds, Chaum, D. and Evertse, J. H.
  • Crypto '86, Some variations on RSA signatures and their security, de Jonge, W. and Chaum, D.
  • Crypto '86, A secure and privacy-protecting protocol for transmitting personal information between organizations, Chaum, D. and Evertse, J. H.
  • Crypto '86, Demonstrating that a public predicate can be satisfied without revealing any information about how, Chaum, D.
  • Crypto '86, Demonstrating possession of a discrete logarithm without revealing it, Chaum, D., Evertse, J. H., van de Graaf, J. and Peralta, R.
  • Eurocrypt '87, An improved protocol for demonstrating possession of discrete logarithms and some generalizations, Chaum, D., Evertse, J. H. and van de Graaf, J.
  • Eurocrypt '87, Blinding for unanticipated signatures, Chaum, D.
  • Crypto '87, Multiparty computations ensuring privacy of each party's input and correctness of the result, Chaum, D., Damgård, I. B. and van de Graaf, J.
  • Crypto '87, Gradual and verifiable release of a secret, Brickell, E. F., Chaum, D., Damgård, I. B. and van de Graaf, J.
  • Crypto '87, Multiparty unconditionally secure protocols, Chaum, D., Crépeau, C. and Damgård, I. B.
  • Eurocrypt '88, Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA, Chaum, D.
  • Crypto '88, Untraceable electronic cash, Chaum, D., Fiat, A. and Naor, M.
  • Eurocrypt '89, A European call for cryptographic algorithms: RIPE; Race Integrity Primitives Evaluation, Vandewalle, J., Chaum, D., Fumy, W., Jansen, C. J. A., Landrock, P. and Roelofsen, G.
  • Eurocrypt '89, Online cash checks, Chaum, D.
  • Eurocrypt '89, Efficient offline electronic checks (extended abstract), Chaum, D., den Boer, B., van Heyst, E., Mjoelsnes, S. F. and Steenbeek, A.
  • Crypto '89, Undeniable signatures, Chaum, D. and van Antwerpen, H.
  • Crypto '89, The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptograhically from majorities, Chaum, D.
  • Eurocrypt '90, Zero-knowledge undeniable signatures (extended abstract), Chaum, D.
  • Crypto '90, Convertible undeniable signatures, Boyar, J., Chaum, D., Damgård, I. B. and Pedersen, T. P.
  • Crypto '90, Unconditionally Secure Digital Signatures, Chaum, D. and Roijakkers, Sandra
  • Eurocrypt '91, Direct zero knowledge proofs of computational power in five rounds, Okamoto, T., Chaum, D. and Ohta, K.
  • Eurocrypt '91, Group signatures, Chaum, D. and Heyst, E. van
  • Eurocrypt '91, Race Integrity Primitives Evaluation, Preneel, B., Chaum, D., Fumy, W., Jansen, C. J. A., Landrock, P. and Roelofsen, G.
  • Eurocrypt '91, Some Weaknesses of "Weaknesses of Undeniable Signatures", Chaum, D.
  • Crypto '91, Cryptographically strong undeniable signatures, unconditionally secure for the signer, Chaum, D., van Heijst, E. and Pfitzmann, B.
  • Eurocrypt '92, Transferred cash grows in size, Chaum, D. and Pedersen, T. P.
  • Crypto '92, Provably unforgeable signatures, Bos, J. N. E. and Chaum, D.
  • Crypto '92, Wallet databases with observers, Chaum, D. and Pedersen, T. P.
  • Eurocrypt '93, Distance bounding protocols, Brands, S. and Chaum, D.
  • Eurocrypt '94, Designated confirmer signatures, Chaum, D.
    Chauvaud, P.
  • Crypto '92, On the security of the permuted kernel identification scheme, Baritaud, T., Campana, M., Chauvaud, P. and Gilbert, H.
  • Crypto '93, Improved algorithms for the permuted kernel problem, Patarin, J. and Chauvaud, P.
  • Crypto '94, A chosen plaintext attack of the 16-round cryptosystem, Gilbert, H. and Chauvaud, P.
    Chee, Y. Meng
  • Crypto '91, The cryptanalysis of a new public-key cryptosystem based on modular knapsacks, Chee, Y. Meng, Joux, A. and Stern, J.
    Chen, D.
  • Eurocrypt '85, On feedforward transforms and p-fold periodic p-arrays., Chen, D. and Dai, Z.
    Chen, L.
  • Eurocrypt '92, Security bounds for parallel versions of identification protocols, Chen, L. and Damgård, I. B.
  • Eurocrypt '94, Parallel divertibility of proofs of knowledge, Chen, L., Damgård, I. B. and Pedersen, T. P.
  • Eurocrypt '94, New group signature schemes, Chen, L. and Pedersen, T. P.
  • Eurocrypt '95, On the efficiency of group signatures providing information-theoretic anonymity, Chen, L. and Pedersen, T. P.
    Chen, Su-shing
  • Crypto '84, On rotation group and encryption of analog signals, Chen, Su-shing
    Chepyzhov, V.
  • Eurocrypt '91, On a fast correlation attack on certain stream ciphers, Chepyzhov, V. and Smeets, B.
    Chick, G. C.
  • Crypto '89, Flexible access control with master keys, Chick, G. C. and Tavares, S. E.
    Chor, B.
  • Crypto '84, A knapsack type public key cryptosystem based on arithmetic in finite fields, Chor, B. and Rivest, R. L.
  • Crypto '84, RSA/Rabin least significant bits are 1/2 + 1/poly(log N) secure, Chor, B. and Goldreich, O.
  • Crypto '85, The bit security of modular squaring given partial factorization of the modulos, Chor, B., Goldreich, O. and Goldwasser, S.
  • Crypto '89, Secret sharing over infinite domains (extended abstract), Chor, B. and Kushilevitz, E.
  • Crypto '92, Universally ideal secret sharing schemes (preliminary version), Beimel, A. and Chor, B.
  • Crypto '93, Interaction in key distribution schemes, Beimel, A. and Chor, B.
  • Crypto '94, Tracing traitors, Chor, B., Fiat, A. and Naor, M.
  • Crypto '95, Secret Sharing with Public Reconstruction, Beimel, A. and Chor, B.
    Chow, G.
  • Crypto '81, Results on Sampling-based Scrambling for Secure Speech Communication, Lee, L. and Chow, G.
    Chuang, Chih-Chwen
  • Crypto '90, Matrix extensions of the RSA algorithm, Chuang, Chih-Chwen and Dunham, J. George
    Clark, A. J.
  • Eurocrypt '87, Physical protection of cryptographic devices, Clark, A. J.
    Clark, B. L.
  • Crypto '84, A prototype encryption system using public key, Serpell, S. C., Brookson, C. B. and Clark, B. L.
    Cleve, R.
  • Crypto '89, Controlled gradual disclosure schemes for random bits and their applications, Cleve, R.
  • Crypto '90, Complexity theoretic issues concerning block ciphers related to D.E.S., Cleve, R.
    Cloetens, H.
  • Eurocrypt '86, Additional Properties in the S-Boxes of the DES, Cloetens, H., Bierens, L., Vandewalle, J. and Govaerts, R.
    Cnudde, H.
  • Eurocrypt '89, Cryptel---the practical protection of an existing electronic mail system, Cnudde, H.
    Cohen Benaloh, J.
  • Crypto '86, Cryptographic capsules: a disjunctive primitive for interactive protocols, Cohen Benaloh, J.
  • Crypto '86, Secret sharing homomorphisms: keeping shares of a secret secret, Cohen Benaloh, J.
    Cohen, G. D.
  • Eurocrypt '85, Authorized writing for "write-once" memories., Godlewski, P. and Cohen, G. D.
  • Crypto '85, Some cryptographic aspects of womcodes, Godlewski, P. and Cohen, G. D.
    Cole, G. M.
  • Eurocrypt '87, Message authentication and dynamic passwords, Beker, H. J. and Cole, G. M.
    Cook, B. M.
  • Crypto '86, Architectures for exponentiation in GF(2n), Beth, T., Cook, B. M. and Gollmann, D.
    Coppersmith, D.
  • Crypto '85, Another birthday attack, Coppersmith, D.
  • Crypto '85, Cheating at mental poker, Coppersmith, D.
  • Crypto '85, The real reason for Rivest's phenomenon, Coppersmith, D.
  • Crypto '93, The shrinking generator, Coppersmith, D., Krawczyk, H. and Mansour, Y.
  • Crypto '93, Attacks on the birational permutation signature schemes, Coppersmith, D., Stern, J. and Vaudenay, S.
  • Crypto '94, Attack on the cryptographic scheme NIKS-TAS, Coppersmith, D.
  • Eurocrypt '96, Low-exponent RSA with related messages, Coppersmith, D., Franklin, M. K., Patarin, J. and Reiter, M. K.
  • Eurocrypt '96, Finding a small root of a univariate modular equation, Coppersmith, D.
  • Eurocrypt '96, Finding a small root of a bivariate integer equation; factoring with high bits known, Coppersmith, D.
  • Eurocrypt '97, Lattice Attacks on NTRU, Coppersmith, D. and Shamir, A.
    Coster, M. J.
  • Crypto '89, Addition chain heuristics, Bos, J. N. E. and Coster, M. J.
  • Eurocrypt '91, An improved low-density subset sum algorithm, Coster, M. J., LaMacchia, B. A., Odlyzko, A. M. and Schnorr, C. P.
    Coulthart, K. B.
  • Crypto '84, An LSI random number generator (RNG), Fairfield, R. C., Mortenson, R. L. and Coulthart, K. B.
    Cowen, L.
  • Crypto '89, On the structure of secret key exchange protocols, Bellare, M., Cowen, L. and Goldwasser, S.
    Crépeau, C.
  • Crypto '85, A secure poker protocol that minimizes the effect of player coalitions, Crépeau, C.
  • Crypto '86, Zero-knowledge simulation of Boolean circuits, Brassard, G. and Crépeau, C.
  • Crypto '86, All-or-nothing disclosure of secrets, Brassard, G., Crépeau, C. and Robert, J. M.
  • Crypto '86, A zero-knowledge poker protocol that achieves confidentiality of the players' strategy or How to achieve an electronic poker face, Crépeau, C.
  • Crypto '86, Two observations on probabilistic primality testing, Beauchemin, P., Brassard, G., Crépeau, C. and Goutier, C.
  • Crypto '87, Equivalence between two flavours of oblivious transfers (cryptography), Crépeau, C.
  • Crypto '87, Multiparty unconditionally secure protocols, Chaum, D., Crépeau, C. and Damgård, I. B.
  • Crypto '88, Weakening security assumptions and oblivious transfer, Crépeau, C. and Kilian, J.
  • Eurocrypt '89, Verifiable disclose for secrets and applications (abstract), Crépeau, C.
  • Eurocrypt '89, Sorting out zero-knowledge, Brassard, G. and Crépeau, C.
  • Eurocrypt '89, Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract), Brassard, G., Crépeau, C. and Yung, M.
  • Crypto '90, Quantum bit commitment and coin tossing protocols, Brassard, G. and Crépeau, C.
  • Eurocrypt '91, On the reversibility of oblivious transfer, Crépeau, C. and Santha, M.
  • Crypto '91, Practical quantum oblivious transfer, Bennett, C. H., Brassard, G., Crépeau, C. and Skubiszewska, M. H.
  • Crypto '93, Discreet solitary games, Crépeau, C. and Kilian, J.
  • Eurocrypt '95, Quantum oblivious mutual identification, Crépeau, C. and Salvail, L.
  • Crypto '95, Committed Oblivious Transfer and Private Multi-Party Computation, Crépeau, C., Graaf, J. van de and Tapp, A.
  • Eurocrypt '97, Efficient Cryptographic Protocols Based on Noisy Channels, Crépeau, C.
  • Eurocrypt '97, Oblivious Transfers and Privacy Amplification, Brassard, G. and Crépeau, C.
    Cramer, R.
  • Eurocrypt '93, Improved privacy in wallets with observers, Cramer, R. and Pedersen, T. P.
  • Crypto '94, Proofs of partial knowledge and simplified design of witness hiding protocols, Cramer, R., Damgård, I. B. and Schoenmakers, B.
  • Crypto '95, Secure Signature Schemes based on Interactive Protocols, Cramer, R. and Damgård, I. B.
  • Eurocrypt '96, Multi-authority secret-ballot elections with linear work, Cramer, R., Franklin, M. K., Schoenmakers, B. and Yung, M.
  • Crypto '96, New Generation of Secure and Practical RSA-Based Signatures, Cramer, R. and Damgård, I. B.
  • Eurocrypt '97, Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation, Cramer, R. and Damgård, I. B.
  • Eurocrypt '97, A Secure and Optimally Efficient Multi-Authority Election Scheme, Cramer, R., Gennaro, R. and Schoenmakers, B.
    Cresti, A.
  • Crypto '93, Fully dynamic secret sharing schemes, Blundo, C., Cresti, A., De Santis, A. and Vaccaro, U.
  • Eurocrypt '94, Space requirements for broadcast encryption, Blundo, C. and Cresti, A.
  • Eurocrypt '95, General short computational secret sharing schemes, Beguin, P. and Cresti, A.
    Csirmaz, L.
  • Eurocrypt '94, The size of a share must be large, Csirmaz, L.
    Cusick, T. W.
  • Crypto '90, The REDOC II cryptosystem, Cusick, T. W. and Wood, M. C.
  • Eurocrypt '93, Boolean functions satisfying a higher order strict avalanche criterion, Cusick, T. W.
    D'Amiano, S.
  • Eurocrypt '94, Methodology for digital money based on general cryptographic tools, D'Amiano, S. and Di Crescenzo, G.
  • Eurocrypt '95, Anonymous NIZK proofs of knowledge with preprocessing, D'Amiano, S. and Di Crescenzo, G.
    Daemen, J.
  • Eurocrypt '93, Resynchronization weaknesses in synchronous stream ciphers, Daemen, J., Govaerts, R. and Vandewalle, J.
  • Crypto '93, Weak keys for IDEA, Daemen, J., Govaerts, R. and Vandewalle, J.
    Dai, Z.
  • Eurocrypt '85, On feedforward transforms and p-fold periodic p-arrays., Chen, D. and Dai, Z.
  • Crypto '87, Patterns of entropy drop of the key in an S-box of the DES, Zeng, K., Yang, J.-H. and Dai, Z.
  • Eurocrypt '89, On the Complexity of Pseudo-Random Sequences - or: If you Can Describe a Sequence It Can't be Random, Beth, T. and Dai, Z.
  • Eurocrypt '89, Feedforward functions defined by de Brujin sequences, Dai, Z. and Zeng, K.
  • Eurocrypt '90, Lower bounds for the linear complexity of sequences over residue rings, Dai, Z., Beth, T. and Gollmann, D.
  • Eurocrypt '91, Linear complexity of periodically repeated random sequences, Dai, Z. and Yang, J.-H.
    Damgård, I. B.
  • Eurocrypt '87, Collision free hash functions and public key signature schemes, Damgård, I. B.
  • Crypto '87, Multiparty computations ensuring privacy of each party's input and correctness of the result, Chaum, D., Damgård, I. B. and van de Graaf, J.
  • Crypto '87, Gradual and verifiable release of a secret, Brickell, E. F., Chaum, D., Damgård, I. B. and van de Graaf, J.
  • Crypto '87, Multiparty unconditionally secure protocols, Chaum, D., Crépeau, C. and Damgård, I. B.
  • Eurocrypt '88, Anonymous and verifiable registration in databases, Brandt, J., Damgård, I. B. and Landrock, P.
  • Crypto '88, On the randomness of Legendre and Jacobi sequences, Damgård, I. B.
  • Crypto '88, Payment systems and credential mechanisms with provable security against abuse by individuals, Damgård, I. B.
  • Crypto '88, "Practical IP" < MA, Brassard, G. and Damgård, I. B.
  • Crypto '88, Zero-knowledge authentication scheme with secret key exchange, Brandt, J., Damgård, I. B., Landrock, P. and Pedersen, T. P.
  • Crypto '89, On the existence of bit commitment schemes and zero-knowledge proofs, Damgård, I. B.
  • Crypto '89, A design principle for hash functions, Damgård, I. B.
  • Crypto '90, Convertible undeniable signatures, Boyar, J., Chaum, D., Damgård, I. B. and Pedersen, T. P.
  • Crypto '91, Towards practical public key systems secure against chosen ciphertext attacks, Damgård, I. B.
  • Eurocrypt '92, Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing, Damgård, I. B.
  • Eurocrypt '92, Security bounds for parallel versions of identification protocols, Chen, L. and Damgård, I. B.
  • Crypto '92, On generation of probable primes by incremental search, Brandt, J. and Damgård, I. B.
  • Eurocrypt '93, Practical and provably secure release of a secret and exchange of signatures, Damgård, I. B.
  • Eurocrypt '93, The breaking of the AR hash function, Damgård, I. B. and Knudsen, L. R.
  • Crypto '93, Interactive hashing can simplify zero-knowledge protocol design without computational assumptions, Damgård, I. B.
  • Crypto '93, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, Damgård, I. B., Pedersen, T. P. and Pfitzmann, B.
  • Eurocrypt '94, Parallel divertibility of proofs of knowledge, Chen, L., Damgård, I. B. and Pedersen, T. P.
  • Crypto '94, Proofs of partial knowledge and simplified design of witness hiding protocols, Cramer, R., Damgård, I. B. and Schoenmakers, B.
  • Crypto '95, Secure Signature Schemes based on Interactive Protocols, Cramer, R. and Damgård, I. B.
  • Crypto '95, Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs, Damgård, I. B., Goldreich, O., Okamoto, T. and Wigderson, A.
  • Eurocrypt '96, New convertible undeniable signature schemes, Damgård, I. B. and Pedersen, T. P.
  • Crypto '96, New Generation of Secure and Practical RSA-Based Signatures, Cramer, R. and Damgård, I. B.
  • Eurocrypt '97, Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation, Cramer, R. and Damgård, I. B.
    Damm, F.
  • Eurocrypt '94, MIMD-factorisation on hypercubes, Damm, F., Heider, F. P. and Wambach, G.
    Dancs, F. B.
  • Crypto '87, A cryptoengine, Davida, G. I. and Dancs, F. B.
    Davenport, D. M.
  • Crypto '89, On the classification of ideal secret sharing schemes (extended abstract), Brickell, E. F. and Davenport, D. M.
    Davida, G. I.
  • Eurocrypt '86, Multilevel Cryptosecure Relational Database, Davida, G. I. and Yeh, Y. S.
  • Eurocrypt '87, A public key analog cryptosystem, Davida, G. I. and Walter, G. G.
  • Crypto '87, Arbitration in tamper proof systems. If DES approximately=RSA then what's the difference between true signature and arbitrated signature schemes?, Davida, G. I. and Matt, B. J.
  • Crypto '87, A cryptoengine, Davida, G. I. and Dancs, F. B.
  • Eurocrypt '88, Passports and Visas versus IDs, Davida, G. I. and Desmedt, Y.
  • Eurocrypt '89, A key distribution system based on any one-way function (extended abstract), Davida, G. I., Desmedt, Y. and Peralta, R.
  • Eurocrypt '90, On the importance of memory resources in the security of key exchange protocols (extended abstract), Davida, G. I., Desmedt, Y. and Peralta, R.
    Davies, D. W.
  • Crypto '81, Some Regular Properties of the DES, Davies, D. W.
  • Eurocrypt '82, The average cycle size of the key-stream in output feedback encipherment, Davies, D. W. and Parkin, G. I. P.
  • Crypto '82, Some regular properties of the 'Data Encryption Standard' algorithm (Presented at CRYPTO 81), Davies, D. W.
  • Crypto '82, The average cycle size of the key stream in output feedback encipherment (Abstract), Davies, D. W. and Parkin, G. I. P.
  • Crypto '83, Use of the "signature token" to create a negotiable document, Davies, D. W.
  • Crypto '84, A message authenticator algorithm suitable for a mainframe computer, Davies, D. W.
  • Eurocrypt '85, Engineering secure information systems., Davies, D. W. and Price, W. L.
    Davio, M.
  • Eurocrypt '82, Authentication procedures, Davio, M., Goethals, J. M. and Quisquater, J. J.
  • Crypto '83, Analytical characteristics of the DES, Davio, M., Desmedt, Y., Fosseprez, M., Govaerts, R., Hulsbosch, J., Neutjens, P., Piret, P., Quisquater, J. J., Vandewalle, J. and Wouters, P.
  • Eurocrypt '84, Propagation characteristics of the DES, Davio, M., Desmedt, Y. and Quisquater, J. J.
  • Crypto '84, Efficient hardware and software implementations for the DES, Davio, M., Desmedt, Y., Goubert, J., Hoornaert, F. and Quisquater, J. J.
  • Crypto '84, Dependence of output on input in DES: small avalanche characteristics, Desmedt, Y., Quisquater, J. J. and Davio, M.
  • Crypto '85, The importance of "good" key scheduling schemes (how to make a secure DES scheme with < 48 bits keys?), Quisquater, J. J., Desmedt, Y. and Davio, M.
    Davis, D.
  • Crypto '94, Cryptographic randomness from air turbulence in disk drives, Davis, D., Ihaka, R. and Fenstermacher, P.
    Davis, J. A.
  • Crypto '82, A preliminary report on the cryptanalysis of Merkle-Hellman knapsack cryptosystems, Brickell, E. F., Davis, J. A. and Simmons, G. J.
  • Crypto '83, Factorization using the Quadratic Sieve algorithm, Davis, J. A. and Holdridge, D. B.
  • Eurocrypt '84, Status report on factoring (at the Sandia National Labs), Davis, J. A., Holdridge, D. B. and Simmons, G. J.
  • Crypto '84, An update on factorization at Sandia National Laboratories, Davis, J. A. and Holdridge, D. B.
  • Eurocrypt '88, Factorization of large integers on a massively parallel computer, Davis, J. A. and Holdridge, D. B.
    Dawson, E.
  • Eurocrypt '91, The Automated Cryptanalysis of Analog Speech Scramblers, Goldburg, B., Dawson, E. and Sridharan, S.
    Dawson, M. H.
  • Eurocrypt '91, An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks, Dawson, M. H. and Tavares, S. E.
    De Becker, W.
  • Eurocrypt '85, Implementation study of public key cryptography protection in an existing electronic mail and document handling system., Vandewalle, J., Govaerts, R., De Becker, W., Decroos, M. and Speybrouck, G.
    de Jonge, W.
  • Crypto '85, Attacks on some RSA signatures, de Jonge, W. and Chaum, D.
  • Crypto '86, Some variations on RSA signatures and their security, de Jonge, W. and Chaum, D.
    De Man, H.
  • Eurocrypt '87, Security considerations in the design and implementation of a new DES chip, Verbauwhede, I., Hoornaert, F., Vandewalle, J. and De Man, H.
    De Santis, A.
  • Crypto '87, Noninteractive zero-knowledge proof systems, De Santis, A., Micali, S. and Persiano, G.
  • Crypto '88, Non-interactive zero-knowledge with preprocessing, De Santis, A., Micali, S. and Persiano, G.
  • Eurocrypt '90, Public-randomness in public-key cryptography (extended abstract), De Santis, A. and Persiano, G.
  • Eurocrypt '90, On the design of provably-secure cryptographic hash functions, De Santis, A. and Yung, M.
  • Crypto '90, Cryptographic applications of the non-interactive metaproof and many-prover systems (Preliminary version), De Santis, A. and Yung, M.
  • Crypto '91, On the size of shares for secret sharing schemes, Capocelli, R. M., De Santis, A., Gargano, L. and Vaccaro, U.
  • Eurocrypt '92, Graph decompositions and secret sharing schemes, Blundo, C., De Santis, A., Stinson, D. R. and Vaccaro, U.
  • Crypto '92, On the information rate of secret sharing schemes, Blundo, C., De Santis, A., Gargano, L. and Vaccaro, U.
  • Crypto '92, Perfectly-secure key distribution for dynamic conferences, Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U. and Yung, M.
  • Eurocrypt '93, Size of shares and probability of cheating in threshold schemes, Carpentieri, M., De Santis, A. and Vaccaro, U.
  • Crypto '93, Secret sharing and perfect zero-knowledge, De Santis, A., Di Crescenzo, G. and Persiano, G.
  • Crypto '93, Fully dynamic secret sharing schemes, Blundo, C., Cresti, A., De Santis, A. and Vaccaro, U.
  • Crypto '94, Multi-secret sharing schemes, Blundo, C., De Santis, A., Di Crescenzo, G., Gaggia, A. Giorgio and Vaccaro, U.
    De Soete, M.
  • Eurocrypt '88, Some constructions for authentication-secrecy codes, De Soete, M.
  • Eurocrypt '88, Some new classes of geometric threshold schemes, De Soete, M. and Vedder, K.
  • Crypto '88, Bounds and Constructions for Authentication-Secrecy Codes with Splitting, De Soete, M.
  • Eurocrypt '89, Cartesian authentication schemes, De Soete, M., Vedder, K. and Walker, M.
  • Crypto '89, A signature with shared verification scheme, De Soete, M., Quisquater, J. J. and Vedder, K.
    De Waleffe, D.
  • Crypto '90, CORSAIR: A smart card for public key cryptosystems, De Waleffe, D. and Quisquater, J. J.
    Decroos, M.
  • Eurocrypt '85, Implementation study of public key cryptography protection in an existing electronic mail and document handling system., Vandewalle, J., Govaerts, R., De Becker, W., Decroos, M. and Speybrouck, G.
  • Eurocrypt '88, Fast RSA-hardware: dream or reality, Hoornaert, F., Decroos, M., Vandewalle, J. and Govaerts, R.
    DeLaurentis, J. M.
  • Crypto '85, An attack on a signature scheme proposed by Okamoto and Shiraishi, Brickell, E. F. and DeLaurentis, J. M.
  • Crypto '87, Components and cycles of a random function, DeLaurentis, J. M.
    Delescaille, J. P.
  • Crypto '87, Other cycling tests for DES, Quisquater, J. J. and Delescaille, J. P.
  • Eurocrypt '89, How easy is collision search? Application to DES, Quisquater, J. J. and Delescaille, J. P.
  • Crypto '89, How easy is collision search. New results and applications to DES, Quisquater, J. J. and Delescaille, J. P.
    Delos, O.
  • Crypto '94, An identity-based signature scheme with bounded life-span, Delos, O. and Quisquater, J. J.
    Delsarte, P.
  • Eurocrypt '84, Fast cryptanalysis of the Matsumoto-Imai public key scheme, Desmedt, Y., Delsarte, P., Odlyzko, A. M. and Piret, P.
    DeMarrais, J.
  • Crypto '93, A subexponential algorithm for discrete logarithms over all finite fields, Adleman, L. M. and DeMarrais, J.
    DeMillo, R. A.
  • Eurocrypt '97, On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract), Boneh, D., DeMillo, R. A. and Lipton, R. J.
    Demytko, N.
  • Eurocrypt '93, A new elliptic curve based analogue of RSA, Demytko, N.
    den Boer, B.
  • Eurocrypt '88, Cryptanalysis of F.E.A.L., den Boer, B.
  • Crypto '88, Diffie-Hellman is as strong as discrete log for certain primes, den Boer, B.
  • Eurocrypt '89, More efficient match-making and satisfiability, den Boer, B.
  • Eurocrypt '89, Efficient offline electronic checks (extended abstract), Chaum, D., den Boer, B., van Heyst, E., Mjoelsnes, S. F. and Steenbeek, A.
  • Eurocrypt '89, Detection of disrupters in the DC protocol, Bos, J. N. E. and den Boer, B.
  • Eurocrypt '90, Oblivious transfer protecting secrecy, den Boer, B.
  • Crypto '91, An attack on the last two rounds of MD4, den Boer, B. and Bosselaers, A.
  • Eurocrypt '93, Collisions for the compression function of MD-5, den Boer, B. and Bosselaers, A.
    Denayer, T.
  • Eurocrypt '89, A single chip 1024 bits RSA processor, Vandemeulebroecke, A., Vanzieleghem, E., Jespers, P. G. A. and Denayer, T.
    Denning, D. E.
  • Crypto '83, Field encryption and authentication., Denning, D. E.
    Denny, T.
  • Crypto '93, On the factorization of RSA-120, Denny, T., Dodson, B., Lenstra, A. K. and Manasse, M. S.
    Dertouzos, M. L.
  • Crypto '81, Panel Discussion: National Security and Commercial Security: Division of Responsibility, Diffie, W., Klein, M., Dertouzos, M. L., Gleason, A. and Smith, D.
    Desmedt, Y.
  • Crypto '83, Analytical characteristics of the DES, Davio, M., Desmedt, Y., Fosseprez, M., Govaerts, R., Hulsbosch, J., Neutjens, P., Piret, P., Quisquater, J. J., Vandewalle, J. and Wouters, P.
  • Eurocrypt '84, Propagation characteristics of the DES, Davio, M., Desmedt, Y. and Quisquater, J. J.
  • Eurocrypt '84, Fast cryptanalysis of the Matsumoto-Imai public key scheme, Desmedt, Y., Delsarte, P., Odlyzko, A. M. and Piret, P.
  • Crypto '84, Efficient hardware and software implementations for the DES, Davio, M., Desmedt, Y., Goubert, J., Hoornaert, F. and Quisquater, J. J.
  • Crypto '84, Efficient hardware implementation of the DES, Hoornaert, F., Goubert, J. and Desmedt, Y.
  • Crypto '84, Dependence of output on input in DES: small avalanche characteristics, Desmedt, Y., Quisquater, J. J. and Davio, M.
  • Crypto '85, Unconditionally secure authentication schemes and practical and theoretical consequences, Desmedt, Y.
  • Crypto '85, A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, Desmedt, Y. and Odlyzko, A. M.
  • Crypto '85, The importance of "good" key scheduling schemes (how to make a secure DES scheme with < 48 bits keys?), Quisquater, J. J., Desmedt, Y. and Davio, M.
  • Eurocrypt '86, Several Exhaustive Key Search Machines and DES, Desmedt, Y., Hoornaert, F. and Quisquater, J. J.
  • Crypto '86, Public-key systems based on the difficulty of tampering (Is there a difference between DES and RSA?), Desmedt, Y. and Quisquater, J. J.
  • Crypto '86, Is there an ultimate use of cryptography?, Desmedt, Y.
  • Crypto '87, Special uses and abuses of the Fiat Shamir passport protocol, Desmedt, Y., Goutier, C. and Bengio, S.
  • Crypto '87, Society and group oriented cryptography: a new concept, Desmedt, Y.
  • Eurocrypt '88, Subliminal-free authentication and signature, Desmedt, Y.
  • Eurocrypt '88, Passports and Visas versus IDs, Davida, G. I. and Desmedt, Y.
  • Crypto '88, Abuses in cryptography and how to fight them, Desmedt, Y.
  • Eurocrypt '89, A key distribution system based on any one-way function (extended abstract), Davida, G. I., Desmedt, Y. and Peralta, R.
  • Eurocrypt '89, A general zero-knowledge scheme, Burmester, M. V. D., Desmedt, Y., Piper, F. and Walker, M.
  • Crypto '89, Making conditionally secure cryptosystems unconditionally abuse-free in a general context, Desmedt, Y.
  • Crypto '89, Threshold cryptosystems, Desmedt, Y. and Frankel, Y.
  • Eurocrypt '90, All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions (extended abstract), Burmester, M. V. D. and Desmedt, Y.
  • Eurocrypt '90, On the importance of memory resources in the security of key exchange protocols (extended abstract), Davida, G. I., Desmedt, Y. and Peralta, R.
  • Crypto '90, Identification tokens -- or: Solving the chess grandmaster problem, Beth, T. and Desmedt, Y.
  • Crypto '90, Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter's attacks (Extended abstract), Desmedt, Y. and Yung, M.
  • Eurocrypt '91, Broadcast interactive proofs, Burmester, M. V. D. and Desmedt, Y.
  • Eurocrypt '91, Weaknesses of undeniable signature schemes, Desmedt, Y. and Yung, M.
  • Crypto '91, Shared generation of authenticators and signatures, Desmedt, Y. and Frankel, Y.
  • Eurocrypt '92, Classification of ideal homomorphic threshold schemes over finite Abelian groups (Extended abstract), Frankel, Y. and Desmedt, Y.
  • Eurocrypt '92, The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli, Desmedt, Y., Landrock, P., Lenstra, A. K., McCurley, K. S., Odlyzko, A. M., Rueppel, R. A. and Smid, M. E.
  • Crypto '92, Non-existence of homomorphic general sharing schemes for some key spaces, Frankel, Y., Desmedt, Y. and Burmester, M. V. D.
  • Eurocrypt '94, A secure and efficient conference key distribution system, Burmester, M. V. D. and Desmedt, Y.
  • Eurocrypt '95, Securing traceability of ciphertexts - Towards a secure software key escrow system, Desmedt, Y.
  • Eurocrypt '96, Efficient multiplicative sharing schemes, Blackburn, S. R., Burmester, M. V. D., Desmedt, Y. and Wild, R. P.
    Di Crescenzo, G.
  • Crypto '93, Secret sharing and perfect zero-knowledge, De Santis, A., Di Crescenzo, G. and Persiano, G.
  • Eurocrypt '94, Methodology for digital money based on general cryptographic tools, D'Amiano, S. and Di Crescenzo, G.
  • Crypto '94, Multi-secret sharing schemes, Blundo, C., De Santis, A., Di Crescenzo, G., Gaggia, A. Giorgio and Vaccaro, U.
  • Eurocrypt '95, Recycling random bits in composed perfect zero-knowledge, Di Crescenzo, G.
  • Eurocrypt '95, Anonymous NIZK proofs of knowledge with preprocessing, D'Amiano, S. and Di Crescenzo, G.
  • Crypto '97, Keeping the SZK-Verifier Honest Unconditionally, Di Crescenzo, G., Okamoto, T. and Yung, M.
    Di Porto, A.
  • Eurocrypt '88, A probabilistic primality test based on the properties of certain generalized Lucas numbers, Di Porto, A. and Filipponi, P.
    Dial, G.
  • Eurocrypt '86, Sharma-Mittal Entropy and Shannon's Random Cipher Result, Dial, G. and Pessoa, F.
    Dietel, A.
  • Eurocrypt '92, Resource requirements for the application of addition chains in modulo exponentiation, Sauerbrey, J. and Dietel, A.
    Diffie, W.
  • Crypto '81, Panel Discussion: National Security and Commercial Security: Division of Responsibility, Diffie, W., Klein, M., Dertouzos, M. L., Gleason, A. and Smith, D.
  • Crypto '85, Security for the DoD transmission control protocol, Diffie, W.
  • Crypto '85, Analysis of a public key approach based on polynomial substitution, Fell, H. and Diffie, W.
  • Crypto '88, A secure audio teleconference system, Steer, D. G., Strawczynski, L., Diffie, W. and Wiener, M. J.
  • Eurocrypt '89, The adolescence of public-key cryptography (invited), Diffie, W.
    Dijk, M. van
  • Eurocrypt '94, A linear construction of perfect secret sharing schemes, Dijk, M. van
    Ding, C.
  • Eurocrypt '88, Proof of Massey's conjectured algorithm, Ding, C.
  • Eurocrypt '93, On almost perfect nonlinear permutations, Beth, T. and Ding, C.
    Dixon, B.
  • Eurocrypt '92, Massively parallel elliptic curve factoring, Dixon, B. and Lenstra, A. K.
  • Eurocrypt '93, Factoring integers using SIMD sieves, Dixon, B. and Lenstra, A. K.
    Dixon, R. D.
  • Crypto '86, Smallest possible message expansion in threshold schemes, Blakley, G. R. and Dixon, R. D.
    Dlay, S. S.
  • Eurocrypt '88, Properties of the Euler totient function modulo 24 and some of its cryptographic implications, Gorgui-Naguib, R. N. and Dlay, S. S.
    Dodson, B.
  • Crypto '93, On the factorization of RSA-120, Denny, T., Dodson, B., Lenstra, A. K. and Manasse, M. S.
  • Crypto '95, NFS with Four Large Primes: An Explosive Experiment, Dodson, B. and Lenstra, A. K.
    Dolev, D.
  • Crypto '82, On the security of multi-party protocols in distributed systems, Dolev, D. and Wigderson, A.
  • Crypto '82, On the security of ping-pong protocols (Extended abstract), Dolev, D., Even, S. and Karp, R. M.
    Dolev, S.
  • Crypto '97, Efficient Anonymous Multicast and Reception, Dolev, S. and Ostrovsky, R.
    Domingo-Ferrer, J.
  • Eurocrypt '89, Full secure key exchange and authentication with no previously shared secrets, Domingo-Ferrer, J. and Huguet i Rotger, L.
  • Eurocrypt '90, Software run-time protection: A cryptographic issue, Domingo-Ferrer, J.
  • Eurocrypt '93, Un transferable rights in a client-independent server environment, Domingo-Ferrer, J.
    Droste, S.
  • Crypto '96, New Results on Visual Cryptography, Droste, S.
    Duellmann, S.
  • Eurocrypt '89, On the complexity and efficiency of a new key exchange system, Buchmann, J. A., Duellmann, S. and Williams, H. C.
  • Crypto '90, On the computation of discrete logarithms in class groups (Extended abstract), Buchmann, J. A. and Duellmann, S.
    Duhoux, Y.
  • Eurocrypt '89, Deciphering bronze age scripts of Crete. The case of Linear A (invited), Duhoux, Y.
    Dunham, J. George
  • Crypto '90, Matrix extensions of the RSA algorithm, Chuang, Chih-Chwen and Dunham, J. George
    Dusse, S. R.
  • Eurocrypt '90, A cryptographic library for the Motorola DSP 56000, Dusse, S. R. and Kaliski, B. S.
    Dwork, C.
  • Crypto '88, Zero-knowledge with finite state verifiers (invited talk), Dwork, C. and Stockmeyer, L.
  • Crypto '91, On verification in secret sharing, Dwork, C.
  • Crypto '92, Pricing via processing or combatting junk mail, Dwork, C. and Naor, M.
  • Crypto '92, Low communication 2-prover zero-knowledge proofs for NP, Dwork, C., Feige, U., Kilian, J., Naor, M. and Safra, M.
  • Crypto '94, An efficient existentially unforgeable signature scheme and its applications, Dwork, C. and Naor, M.
  • Crypto '97, Deniable Encryption, Canetti, R., Dwork, C., Naor, M. and Ostrovsky, R.
    Eberle, H.
  • Crypto '92, A high-speed DES implementation for network applications, Eberle, H.
    Ecker, A.
  • Eurocrypt '82, Finite semigroups and the RSA-cryptosystem, Ecker, A.
  • Eurocrypt '84, Time-division multiplexing scramblers: selecting permutations and testing the systems, Ecker, A.
  • Eurocrypt '86, Tactical Configurations and Threshold Schemes, Ecker, A.
    Eichinger, B. O.
  • Eurocrypt '85, Message protection by spread spectrum modulation in a packet voice radio link., Kowatsch, M., Eichinger, B. O. and Seifert, F. J.
    Eier, R.
  • Eurocrypt '82, Trapdoors in knapsack cryptosystems, Eier, R. and Lagger, H.
    Eisele, R.
  • Crypto '89, The smart diskette -- A universal user token and personal crypto-engine, Barrett, P. and Eisele, R.
    Eisfeld, J.
  • Eurocrypt '96, Public key encryption and signature schemes based on polynominals over Zn, Schwenk, J. and Eisfeld, J.
    ElGamal, T.
  • Crypto '83, A subexponential time algorithm for computing discrete logarithms over GF(p2), ElGamal, T.
  • Crypto '84, A public key cryptosystem and a signature scheme based on discrete logarithms, ElGamal, T.
  • Crypto '85, On computing logarithms over finite fields, ElGamal, T.
    Eloy, M.
  • Eurocrypt '89, Legal requirements facing new signature technology (invited), Antoine, M., Brakeland, Jean-Franc, Eloy, M. and Poullet, Y.
    Eng, T.
  • Eurocrypt '94, Single-term divisible electronic coins, Eng, T. and Okamoto, T.
    Estes, D.
  • Crypto '85, Breaking the Ong-Schnorr-Shamir signature scheme for quadratic number fields, Estes, D., Adleman, L. M., Kompella, K., McCurley, K. S. and Miller, G. L.
    Even, S.
  • Crypto '81, Protocol for Signing Contracts, Even, S.
  • Crypto '82, On the security of ping-pong protocols (Extended abstract), Dolev, D., Even, S. and Karp, R. M.
  • Crypto '82, A randomized protocol for signing contracts (Extended abstract), Even, S., Goldreich, O. and Lempel, A.
  • Crypto '82, On the security of multi-party ping-pong protocols (Abstract), Even, S. and Goldreich, O.
  • Crypto '83, On the power of cascade ciphers, Even, S. and Goldreich, O.
  • Crypto '83, Electronic wallet, Even, S. and Goldreich, O.
  • Crypto '85, On the security of ping-pong protocols when implemented using the RSA, Even, S., Goldreich, O. and Shamir, A.
  • Crypto '89, On-line/off-line digital signatures, Even, S., Goldreich, O. and Micali, S.
  • Crypto '90, Systolic modular multiplication, Even, S.
    Evertse, J. H.
  • Crypto '85, Cryptanalysis of DES with a reduced number of rounds, Chaum, D. and Evertse, J. H.
  • Crypto '86, A secure and privacy-protecting protocol for transmitting personal information between organizations, Chaum, D. and Evertse, J. H.
  • Crypto '86, Demonstrating possession of a discrete logarithm without revealing it, Chaum, D., Evertse, J. H., van de Graaf, J. and Peralta, R.
  • Eurocrypt '87, An improved protocol for demonstrating possession of discrete logarithms and some generalizations, Chaum, D., Evertse, J. H. and van de Graaf, J.
  • Eurocrypt '87, Linear structures in block ciphers, Evertse, J. H.
  • Eurocrypt '90, Which new RSA signatures can be computed from some given RSA signatures? (extended abstract), Evertse, J. H. and van Heyst, E.
  • Eurocrypt '92, Which new RSA signatures can be computed from RSA signatures, obtained in a specific interactive protocol?, Evertse, J. H. and Heyst, E. van
    Fairfield, R. C.
  • Crypto '84, An LSI digital encryption processor (DEP), Fairfield, R. C., Matusevich, A and Plany, J
  • Crypto '84, An LSI random number generator (RNG), Fairfield, R. C., Mortenson, R. L. and Coulthart, K. B.
    Fam, B. W.
  • Crypto '83, Improving the security of exponential key exchange, Fam, B. W.
    Feige, U.
  • Crypto '88, The noisy oracle problem, Feige, U., Shamir, A. and Tennenholtz, M.
  • Crypto '89, Zero knowledge proofs of knowledge in two rounds, Feige, U. and Shamir, A.
  • Crypto '92, Low communication 2-prover zero-knowledge proofs for NP, Dwork, C., Feige, U., Kilian, J., Naor, M. and Safra, M.
  • Crypto '93, One message proof systems with known space verifiers, Aumann, Y. and Feige, U.
    Feigenbaum, J.
  • Crypto '85, Encrypting problem instances: Or ... can you take advantage of someone without having to trust him?, Feigenbaum, J.
  • Crypto '88, On generating solved instances of computational problems, Abadi, M., Allender, E., Broder, A., Feigenbaum, J. and Hemachandra, L. A.
  • Crypto '90, Security with low communication overhead (Extended abstract), Beaver, D., Feigenbaum, J., Kilian, J. and Rogaway, P.
  • Crypto '90, Hiding instances in zero-knowledge proof systems (Extended abstract), Beaver, D., Feigenbaum, J. and Shoup, V.
    Feldman, F. A.
  • Crypto '87, Fast spectral tests for measuring nonrandomness and the DES, Feldman, F. A.
    Feldman, P.
  • Crypto '88, Proving security against chosen cyphertext attacks, Blum, M., Feldman, P. and Micali, S.
    Feldmeier, D. C.
  • Crypto '89, UNIX password security---ten years later (invited), Feldmeier, D. C. and Karn, P. R.
    Fell, H.
  • Crypto '85, Analysis of a public key approach based on polynomial substitution, Fell, H. and Diffie, W.
    Fellows, M.
  • Crypto '92, Kid Krypto, Fellows, M. and Koblitz, N.
    Fenstermacher, P.
  • Crypto '94, Cryptographic randomness from air turbulence in disk drives, Davis, D., Ihaka, R. and Fenstermacher, P.
    Ferguson, N.
  • Eurocrypt '93, Single term off-line coins, Ferguson, N.
  • Crypto '93, Extensions of single-term coins, Ferguson, N.
    Fiat, A.
  • Crypto '86, How to prove yourself: practical solutions to identification and signature problems, Fiat, A. and Shamir, A.
  • Crypto '88, Untraceable electronic cash, Chaum, D., Fiat, A. and Naor, M.
  • Crypto '89, Batch RSA, Fiat, A.
  • Crypto '93, Broadcast encryption, Fiat, A. and Naor, M.
  • Crypto '94, Tracing traitors, Chor, B., Fiat, A. and Naor, M.
    Filipponi, P.
  • Eurocrypt '88, A probabilistic primality test based on the properties of certain generalized Lucas numbers, Di Porto, A. and Filipponi, P.
    Findlay, P. A.
  • Crypto '89, Modular exponentiation using recursive sums of residues, Findlay, P. A. and Johnson, B. A.
    Fischer, J. B.
  • Eurocrypt '96, An efficient pseudo-random generator provably as secure as syndrome decoding, Fischer, J. B. and Stern, J.
    Fischer, M. J.
  • Crypto '91, Multiparty secret key exchange using a random deal of cards, Fischer, M. J. and Wright, R. N.
    Fischlin, M.
  • Eurocrypt '97, Incremental Cryptography and Memory Checkers, Fischlin, M.
    Fischlin, R.
  • Eurocrypt '97, Stronger Security Proofs for RSA and Rabin Bits, Fischlin, R. and Schnorr, C. P.
    Flajolet, P.
  • Eurocrypt '89, Random mapping statistics (invited), Flajolet, P. and Odlyzko, A. M.
    Forre, R.
  • Eurocrypt '87, Generation of binary sequences with controllable complexity and ideal r-tuple distribution, Siegenthaler, T., Kleiner, A. W. and Forre, R.
  • Crypto '88, The strict avalanche criterion: spectral properties of boolean functions and an extended definition, Forre, R.
  • Eurocrypt '89, A fast correlation attack on nonlinearly feed-forward filtered shift-register sequences, Forre, R.
    Fortune, S.
  • Crypto '84, Poker protocols, Fortune, S. and Merritt, M.
    Fosseprez, M.
  • Crypto '83, Analytical characteristics of the DES, Davio, M., Desmedt, Y., Fosseprez, M., Govaerts, R., Hulsbosch, J., Neutjens, P., Piret, P., Quisquater, J. J., Vandewalle, J. and Wouters, P.
    Frank, O.
  • Eurocrypt '86, Controlling Individual Information in Statistics by Coding, Frank, O. and Weidenman, P.
    Frankel, Y.
  • Eurocrypt '89, A practical protocol for large group oriented networks, Frankel, Y.
  • Crypto '89, Threshold cryptosystems, Desmedt, Y. and Frankel, Y.
  • Crypto '91, Shared generation of authenticators and signatures, Desmedt, Y. and Frankel, Y.
  • Eurocrypt '92, Classification of ideal homomorphic threshold schemes over finite Abelian groups (Extended abstract), Frankel, Y. and Desmedt, Y.
  • Crypto '92, Non-existence of homomorphic general sharing schemes for some key spaces, Frankel, Y., Desmedt, Y. and Burmester, M. V. D.
  • Crypto '95, Escrow Encryption Systems Visited: Attacks, Analysis and Designs, Frankel, Y. and Yung, M.
  • Crypto '95, Cryptanalysis of the Immunized LL Public Key Systems, Frankel, Y. and Yung, M.
  • Crypto '97, Proactive RSA, Frankel, Y., Gemmell, P., MacKenzie, P. D. and Yung, M.
    Franklin, M. K.
  • Crypto '93, Joint encryption and message-efficient secure computation, Franklin, M. K. and Haber, S.
  • Eurocrypt '94, The blinding of weak signatures, Franklin, M. K. and Yung, M.
  • Eurocrypt '95, Verifiable signature sharing, Franklin, M. K. and Reiter, M. K.
  • Eurocrypt '96, Low-exponent RSA with related messages, Coppersmith, D., Franklin, M. K., Patarin, J. and Reiter, M. K.
  • Eurocrypt '96, Multi-authority secret-ballot elections with linear work, Cramer, R., Franklin, M. K., Schoenmakers, B. and Yung, M.
  • Crypto '97, Efficient Generation of Shared RSA Keys, Boneh, D. and Franklin, M. K.
    Friedl, K.
  • Eurocrypt '89, Practical zero-knowledge proofs: Giving hints and using deficiencies, Boyar, J., Friedl, K. and Lund, C.
    Fujioka, A.
  • Eurocrypt '90, Provably secure key-updating schemes in identity-based systems, Shinozaki, S., Itoh, T., Fujioka, A. and Tsujii, S.
  • Eurocrypt '91, Interactive bi-proof systems and undeniable signature schemes, Fujioka, A., Okamoto, T. and Ohta, K.
  • Eurocrypt '91, ESIGN: An efficient digital signature implementation for smart cards, Fujioka, A., Okamoto, T. and Miyaguchi, S.
  • Eurocrypt '92, Secure bit commitment function against divertibility, Ohta, K., Okamoto, T. and Fujioka, A.
  • Crypto '92, An efficient digital signature scheme based on an elliptic curve over the ring Zn, Okamoto, T., Fujioka, A. and Fujisaki, E.
    Fujisaki, E.
  • Crypto '92, An efficient digital signature scheme based on an elliptic curve over the ring Zn, Okamoto, T., Fujioka, A. and Fujisaki, E.
  • Crypto '97, Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, Fujisaki, E. and Okamoto, T.
    Fumy, W.
  • Crypto '87, On the F function of FEAL (cryptography), Fumy, W.
  • Eurocrypt '89, A European call for cryptographic algorithms: RIPE; Race Integrity Primitives Evaluation, Vandewalle, J., Chaum, D., Fumy, W., Jansen, C. J. A., Landrock, P. and Roelofsen, G.
  • Crypto '90, A modular approach to key distribution, Fumy, W. and Munzert, M.
  • Eurocrypt '91, Race Integrity Primitives Evaluation, Preneel, B., Chaum, D., Fumy, W., Jansen, C. J. A., Landrock, P. and Roelofsen, G.
    Furst, M.
  • Crypto '93, Cryptographic primitives based on hard learning problems, Blum, A., Furst, M., Kearns, M. and Lipton, R. J.
    Gabidulin, E. M.
  • Eurocrypt '91, Ideals over a non-commutative ring and their application in cryptology, Gabidulin, E. M., Paramonov, A. V. and Tretjakov, O. V.
    Gaggia, A. Giorgio
  • Crypto '94, Multi-secret sharing schemes, Blundo, C., De Santis, A., Di Crescenzo, G., Gaggia, A. Giorgio and Vaccaro, U.
    Galil, Z.
  • Crypto '85, Symmetric public-key encryption, Galil, Z., Haber, S. and Yung, M.
  • Crypto '87, Cryptographic computation: secure fault tolerant protocols and the publickey model, Galil, Z., Haber, S. and Yung, M.
  • Eurocrypt '89, A secure public-key authentication scheme, Galil, Z., Haber, S. and Yung, M.
    Gallo, V. A.
  • Crypto '88, The application of smart cards for RSA digital signatures in a network comprising both interactive and store-and-forward facilities, Sherwood, J. R. and Gallo, V. A.
    Games, R. A.
  • Crypto '86, On the linear span of binary sequences obtained from finite geometries, Chan, A. H. and Games, R. A.
  • Crypto '89, On the quadratic spans of periodic sequences, Chan, A. H. and Games, R. A.
  • Eurocrypt '93, Blind synchronization of m-sequences with even span, Games, R. A. and Rushanan, J. J.
    Gargano, L.
  • Crypto '91, On the size of shares for secret sharing schemes, Capocelli, R. M., De Santis, A., Gargano, L. and Vaccaro, U.
  • Crypto '92, On the information rate of secret sharing schemes, Blundo, C., De Santis, A., Gargano, L. and Vaccaro, U.
    Gasser, M.
  • Crypto '81, Limitations on the Use of Encryption to Enforce Mandatory Security, Gasser, M.
    Gehrmann, C.
  • Crypto '94, Cryptanalysis of the Gemmell and Naor multiround authentication protocol, Gehrmann, C.
    Gehrmann, C.
  • Eurocrypt '95, Secure multiround authentication protocols, Gehrmann, C.
    Gemmell, P.
  • Crypto '93, Codes for interactive authentication, Gemmell, P. and Naor, M.
  • Crypto '97, Proactive RSA, Frankel, Y., Gemmell, P., MacKenzie, P. D. and Yung, M.
    Gennaro, R.
  • Eurocrypt '95, Verifiable secret sharing as secure computation, Gennaro, R. and Micali, S.
  • Eurocrypt '96, Robust threshold DSS signatures, Gennaro, R., Jarecki, S., Krawczyk, H. and Rabin, T.
  • Crypto '96, Robust and Efficient Sharing of RSA Functions, Gennaro, R., Jarecki, S., Krawczyk, H. and Rabin, T.
  • Eurocrypt '97, A Secure and Optimally Efficient Multi-Authority Election Scheme, Cramer, R., Gennaro, R. and Schoenmakers, B.
  • Crypto '97, RSA-Based Undeniable Signatures, Gennaro, R., Krawczyk, H. and Rabin, T.
  • Crypto '97, How to Sign Digital Streams, Gennaro, R. and Rohatgi, P.
    Gibson, J. K.
  • Eurocrypt '91, Equivalent Goppa codes and trapdoors to McEliece's public key cryptosystem, Gibson, J. K.
  • Eurocrypt '96, The security of the Gabidulin public key cryptosystem, Gibson, J. K.
    Gilbert, H.
  • Crypto '90, A statistical attack of the FEAL cryptosystem, Gilbert, H. and Chasse, G.
  • Crypto '91, A known plaintext attack of FEAL and FEAL-6, Tardy-Corfdir, A. and Gilbert, H.
  • Eurocrypt '92, FFT hashing is not collision-free, Baritaud, T., Gilbert, H. and Girault, M.
  • Crypto '92, On the security of the permuted kernel identification scheme, Baritaud, T., Campana, M., Chauvaud, P. and Gilbert, H.
  • Crypto '94, A chosen plaintext attack of the 16-round cryptosystem, Gilbert, H. and Chauvaud, P.
    Giorgio Gaggia, A.
  • Eurocrypt '94, On the dealer's randomness required in secret sharing schemes, Blundo, C., Giorgio Gaggia, A. and Stinson, D. R.
    Girardot, Y.
  • Eurocrypt '84, Bull CP8 smart card uses in cryptology, Girardot, Y.
    Girault, M.
  • Eurocrypt '87, Hash functions using modulo-N operations, Girault, M.
  • Eurocrypt '88, A generalized birthday attack, Girault, M.
  • Eurocrypt '88, How to break Okamoto's cryptosystem by reducing lattice bases, Vallee, B., Girault, M. and Toffin, P.
  • Crypto '88, Computation of approximate L-th roots modulo n and application to cryptography, Girault, M., Toffin, P. and Vallee, B.
  • Eurocrypt '89, 2n-BIT hash-functions using n-BIT symmetric block cipher algorithms, Quisquater, J. J. and Girault, M.
  • Eurocrypt '90, An identity-based identification scheme based on discrete logarithms modulo a composite number, Girault, M.
  • Eurocrypt '91, Self-certified public keys, Girault, M.
  • Eurocrypt '92, FFT hashing is not collision-free, Baritaud, T., Gilbert, H. and Girault, M.
  • Crypto '94, On the length of cryptographic hash-values used in identification schemes, Girault, M. and Stern, J.
  • Eurocrypt '97, Selective Forgery of RSA Signatures Using Redundancy, Girault, M. and Misarsky, J.-F.
    Glass, A. S.