Advances in Cryptology — CRYPTO’ 89 Proceedings

CRYPTO is a conference devoted to all aspects of cryptological research. It is held each year at the University of California, Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this series under the name of EUROCRYPT. This volume presents the proceedings of the 9th CRYPTO meeting. The papers are organized into sections with the following themes: why is cryptography harder than it looks?; pseudo-randomness and sequences; cryptanalysis and implementation; signature and authentication; threshold schemes and key management; key distribution and network security; fast computation; zero-knowledge and obvious transfer, and multiparty computation.

[1]  Silvio Micali,et al.  How To Sign Given Any Trapdoor Function , 1988, CRYPTO.

[2]  G. R. Blakley,et al.  Security Proofs for Information Protection Systems , 1981, 1981 IEEE Symposium on Security and Privacy.

[3]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[4]  Amos Fiat,et al.  Zero-knowledge proofs of identity , 1988, Journal of Cryptology.

[5]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[6]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[7]  Jan van Leeuwen.  An extension of Hansen's theorem for star chains. , 1977 .

[8]  Oded Goldreich,et al.  Cryptography and Computer Security , 2003 .

[9]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[11]  Hugh C. Williams,et al.  A modification of the RSA public-key encryption procedure (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[12]  Edwin Weiss,et al.  A user authentication scheme not requiring secrecy in the computer , 1974, Commun. ACM.

[13]  Claus-Peter Schnorr,et al.  On the Construction of Random Number Generators and Random Function Generators , 1988, EUROCRYPT.

[14]  Gustavus J. Simmons,et al.  How to (Really) Share a Secret , 1988, CRYPTO.

[15]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[16]  David Chaum,et al.  Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result , 1987, CRYPTO.

[17]  Adi Shamir,et al.  On Digital Signatures and Public-Key Cryptosystems. , 1977 .

[18]  E. Shult,et al.  Permutation Groups with Few Fixed Points , 1981 .

[19]  I-Ngo Chen,et al.  An algorithm for modular exponentiation , 1981, 1981 IEEE 5th Symposium on Computer Arithmetic (ARITH).

[20]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

[21]  Moni Naor,et al.  Bit Commitment Using Pseudo-Randomness , 1989, CRYPTO.

[22]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[23]  P. Cameron.  FINITE PERMUTATION GROUPS AND FINITE SIMPLE GROUPS , 1981 .

[24]  Dorothy E. Denning,et al.  Cryptography and Data Security , 1982 .

[25]  Carl H. Meyer,et al.  Ciphertext/plaintext and ciphertext/key dependence vs. number of rounds for the data encryption standard , 1899, AFIPS National Computer Conference.

[26]  Moti Yung,et al.  Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds , 1989, ICALP.

[27]  David Chaum,et al.  An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations , 1987, EUROCRYPT.

[28]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[29]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[30]  Richard M. Karp,et al.  On the Security of Ping-Pong Protocols , 1982, Information and Control.

[31]  Marvin C. Wunderlich,et al.  On the parallel generation of the residues for the continued fraction factoring algorithm , 1987 .

[32]  Peter J. Downey,et al.  Computing Sequences with Addition Chains , 1981, SIAM J. Comput..

[33]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[34]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[35]  Chris J. Mitchell,et al.  Algorithms for software implementations of RSA , 1989 .

[36]  Henri Cohen,et al.  Heuristics on class groups of number fields , 1984 .

[37]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[38]  Silvio Micali,et al.  Non-Interactive Zero-Knowledge Proof Systems , 1987, CRYPTO.

[39]  Josh Benaloh,et al.  Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols , 1986, CRYPTO.

[40]  Ralph C. Merkle,et al.  Secure communications over insecure channels , 1978, CACM.

[41]  Y. H. Chin,et al.  A study of some addition chain problems , 1987 .

[42]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[43]  Edward G. Thurber.  Addition chains and solutions of l(2n) = l(n) and l(2n - 1) = n + l(n) - 1 , 1976, Discret. Math..

[44]  Neal Koblitz,et al.  a course in number theory , 1987 .

[45]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[46]  A. J. Surkan,et al.  A new random number generator from permutation groups , 1985 .

[47]  P. W. Baker.  Fast computation of A * B modulo N , 1987 .

[48]  Fred B. Schneider,et al.  Master Keys for Group Sharing , 1981, Inf. Process. Lett..

[49]  David Chaum,et al.  Attacks on Some RSA Signatures , 1985, CRYPTO.

[50]  Moni Naor,et al.  Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.

[51]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[52]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[53]  G. R. Blakley,et al.  A Computer Algorithm for Calculating the Product AB Modulo M , 1983, IEEE Trans. Computers.

[54]  Jeffrey C. Lagarias,et al.  Solving low density subset sum problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[55]  Andrew Chi-Chih Yao,et al.  On the Evaluation of Powers , 1976, SIAM J. Comput..

[56]  Oded Goldreich,et al.  Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme , 1986, CRYPTO.

[57]  Srecko Brlek,et al.  Addition Chains Using Continued Fractions , 1989, J. Algorithms.

[58]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[59]  V. Thomas Rhyne,et al.  A Canonical Bit-Sequential Multiplier , 1982, IEEE Transactions on Computers.

[60]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[61]  Douglas R. Stinson,et al.  A Combinatorial Approach to Threshold Schemes , 1987, CRYPTO.

[62]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[63]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[64]  Ralph C. Merkle,et al.  A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.

[65]  Stuart A. Kurtz,et al.  A discrete logarithm implementation of zero-knowledge blobs , 1987 .

[66]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[67]  Martín Abadi,et al.  On hiding information from an oracle , 1987, STOC '87.

[68]  Alan T. Sherman,et al.  Is the data encryption standard a group , 1986 .

[69]  Emanuel Vegh,et al.  A Note on Addition Chains , 1975, Journal of combinatorial theory. Series A.

[70]  Yair Frankel,et al.  A Practical Protocol for Large Group Oriented Networks , 1990, EUROCRYPT.

[71]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[72]  Richard J. Lipton,et al.  Addition Chain Methods for the Evaluation of Specific Polynomials , 1980, SIAM J. Comput..

[73]  Gustavus J. Simmons,et al.  A Natural Taxonomy for Digital Information Authentication Schemes , 1987, CRYPTO.

[74]  Stanley E. Payne.  Generalized Quadrangles of Even Order , 1974 .

[75]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.