Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings (Q1202149): Difference between revisions

The articles of this volume will be reviewed individually. Indexed articles: \textit{Biham, Eli; Shamir, Adi}, Differential cryptanalysis of DES-like cryptosystems. (Extended abstract), 2-21 [Zbl 0787.94014] \textit{Gilbert, Henri; Chassé, Guy}, A statistical attack of the FEAL-8 cryptosystem, 22-33 [Zbl 0800.94189] \textit{Zeng, Kencheng; Yang, C. H.; Rao, T. R. N.}, An improved linear syndrome algorithm in cryptanalysis with applications, 34-47 [Zbl 0788.94015] \textit{Brassard, Gilles; Crépeau, Claude}, Quantum bit commitment and coin tossing protocols, 49-61 [Zbl 0800.68415] \textit{Beaver, D.; Feigenbaum, J.; Kilian, J.; Rogaway, P.}, Security with low communication overhead. (Extended abstract), 62-76 [Zbl 0800.68416] \textit{Goldwasser, Shafi; Levin, Leonid}, Fair computation of general functions in presence of immoral majority, 77-93 [Zbl 0800.68459] \textit{Brassard, Gilles; Yung, Moti}, One-way group actions, 94-107 [Zbl 0800.68413] \textit{LaMacchia, B. A.; Odlyzko, A. M.}, Solving large sparse linear systems over finite fields, 109-133 [Zbl 0786.65028] \textit{Buchmann, Johannes; Düllmann, Stephan}, On the computation of discrete logarithms in class groups. (Extended abstract), 134-139 [Zbl 0801.11050] \textit{Chuang, Chih-Chwen; Dunham, James George}, Matrix extensions of the RSA algorithm, 140-155 [Zbl 0786.94008] \textit{Koblitz, Neal}, Constructing elliptic curve cryptosystems in characteristic 2, 156-167 [Zbl 0788.94012] \textit{Beth, Thomas; Desmedt, Yvo}, Identification tokens -- or: Solving the chess grandmaster problem, 169-176 [Zbl 0800.68410] \textit{Desmedt, Yvo; Yung, Moti}, Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter's attacks. (Extended abstract), 177-188 [Zbl 0800.68419] \textit{Boyar, Joan; Chaum, David; Damgård, Ivan; Pedersen, Torben}, Convertible undeniable signatures, 189-205 [Zbl 0800.68405] \textit{Simmons, Gustavus J.}, Geometric shared secret and/or shared control schemes, 216-241 [Zbl 0800.68406] \textit{Brickell, E. F.; Stinson, D. R.}, Some improved bounds on the information rate of perfect secret sharing schemes. (Extended abstract), 242-252 [Zbl 0800.68421] \textit{Micali, Silvio; Rabin, Tal}, Collective coin tossing without assumptions nor broadcasting, 253-266 [Zbl 0800.68404] \textit{Yacobi, Yacov}, A key distribution ``paradox'', 268-273 [Zbl 0800.68402] \textit{Fumy, Walter; Munzert, Michael}, A modular approach to key distribution, 274-283 [Zbl 0800.94185] \textit{Zheng, Yuliang; Matsumoto, Tsutomu; Imai, Hideki}, Structural properties of one-way hash functions, 285-302 [Zbl 0800.68417] \textit{Rivest, Ronald L.}, The MD4 message digest algorithm, 303-311 [Zbl 0800.68418] \textit{Kilian, J.}, Achieving zero-knowledge robustly, 313-325 [Zbl 0800.68403] \textit{Beaver, Donald; Feigenbaum, Joan; Shoup, Victor}, Hiding instances in zero-knowledge proof systems. (Extended abstract), 326-338 [Zbl 0800.68407] \textit{Kurosawa, Kaoru; Tsujii, Shigeo}, Multi-language zero knowledge interactive proof systems, 339-352 [Zbl 0800.68412] \textit{Lapidot, Dror; Shamir, Adi}, Publicly verifiable non-interactive zero-knowledge proofs, 353-365 [Zbl 0800.68414] \textit{De Santis, Alfredo; Yung, Moti}, Cryptographic applications of the non-interactive metaproof and many-prover systems. (Preliminary version), 366-377 [Zbl 0800.68420] \textit{Kilian, J.}, Interactive proofs with provable security against honest verifiers, 378-392 [Zbl 0800.68411] \textit{Schrift, A. W.; Shamir, A.}, On the universality of the next bit test, 394-408 [Zbl 0786.94007] \textit{Maurer, Ueli M.}, A universal statistical test for random bit generators, 409-420 [Zbl 0789.62005] \textit{McInnes, James L.; Pinkas, Benny}, On the impossibility of private key cryptography with weakly random keys, 421-435 [Zbl 0786.94012] \textit{Haber, Stuart; Stornetta, W. Scott}, How to time-stamp a digital document, 437-455 [Zbl 0800.68408] \textit{Okamoto, Tatsuaki; Ohta, Kazuo}, How to utilize the randomness of zero-knowledge proofs. (Extended abstract), 456-475 [Zbl 0800.68409] \textit{Merkle, Ralph C.}, Fast software encryption functions, 476-501 [Zbl 0800.94193] \textit{De Waleffe, Dominique; Quisquater, Jean-Jacques}, CORSAIR: a smart card for public key cryptosystems, 502-513 [Zbl 0800.94191] \textit{Kompella, Kireeti; Adleman, Leonard}, Fast checkers for cryptography, 515-529 [Zbl 0800.68554] \textit{Cleve, Richard}, Complexity theoretic issues concerning block ciphers related to D.E.S, 530-544 [Zbl 0800.68498] \textit{Cusick, Thomas W.; Wood, Michael C.}, The REDOC II cryptosystem, 545-563 [Zbl 0786.94009] \textit{Kim, Kwangjo; Matsumoto, Tsutomu; Imai, Hideki}, A recursive construction method of \(S\)-boxes satisfying strict avalanche criterion, 564-574 [Zbl 0786.94010] \textit{van Oorschot, Paul C.}, A comparison of practical public-key cryptosystems based on integer factorization and discrete logarithms, 576-581 [Zbl 0800.94199] \textit{Koyama, Kenji; Terada, Routo}, Nonlinear parity circuits and their cryptographic applications, 582-600 [Zbl 0786.94011] \textit{Staffelbach, Othmar; Meier, Willi}, Cryptographic significance of the carry for ciphers based on integer addition, 601-614 [Zbl 0786.94013] \textit{LaMacchia, B. A.; Odlyzko, A. M.}, Computation of discrete logarithms in prime fields. (Extended abstract), 616-618 [Zbl 0825.94180] \textit{Even, Shimon}, Systolic modular multiplication, 619-624 [Zbl 0800.94288] \textit{Rivest, Ronald L.}, Finding four million large random primes, 625-626 [Zbl 0791.11072] \textit{Yacobi, Yacov}, Discrete-log with compressible exponents, 639-643 [Zbl 0800.94192]