Advances in Cryptology - CRYPTO '92. 12th annual international cryptology conference, Santa Barbara, CA, USA, August 16-20, 1992. Proceedings (Q690319)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Bos, Jurjen N. E.; Chaum, David}, Provably unforgeable signatures, 1-14 [Zbl 0808.94023] \textit{van Heijst, Eugène; Pedersen, Torben Pryds; Pfitzmann, Birgit}, New constructions of fail-stop signatures and lower bounds, 15-30 [Zbl 0925.94089] \textit{Okamoto, Tatsuaki}, Provably secure and practical identification schemes and corresponding signature schemes, 31-53 [Zbl 0809.94008] \textit{Okamoto, Tatsuaki; Fujioka, Atsushi; Fujisaki, Eiichiro}, An efficient digital signature scheme based on an elliptic curve over the ring \(\mathbb{Z}_ n\), 54-65 [Zbl 0828.94011] \textit{Gordon, Daniel M.}, Designing and detecting trapdoors for discrete log cryptosystems, 66-75 [Zbl 0809.94007] \textit{Micali, Silvio}, Fair public-key cryptosystems, 113-138 [Zbl 0925.94087] \textit{Dwork, Cynthia; Naor, Moni}, Pricing via processing or combatting junk mail, 139-147 [Zbl 0925.94094] \textit{Blundo, Carlo; De Santis, Alfredo; Gargano, Luisa; Vaccaro, Ugo}, On the information rate of secret sharing schemes, 148-167 [Zbl 0809.94009] \textit{Stinson, D. R.}, New general lower bounds on the information rate of secret sharing schemes, 168-182 [Zbl 0809.94010] \textit{Beimel, Amos; Chor, Benny}, Universally ideal secret sharing schemes (preliminary version), 183-195 [Zbl 0925.94096] \textit{Naor, Moni; Ostrovsky, Rafail; Venkatesan, Ramarathnam; Yung, Moti}, Perfect zero-knowledge arguments for NP can be based on general complexity assumptions, 196-214 [Zbl 0925.68145] \textit{Dwork, Cynthia; Feige, Uri; Kilian, Joe; Naor, Moni; Safra, Muli}, Low communication 2-prover zero-knowledge proofs for NP, 215-227 [Zbl 0925.68143] \textit{Goldwasser, Shafi; Ostrovsky, Rafail}, Invariant signatures and non-interactive zero-knowledge proofs are equivalent, 228-245 [Zbl 0925.68142] \textit{Sakurai, Kouichi; Itoh, Toshiya}, On the discrepancy between serial and parallel of zero-knowledge protocols, 246-259 [Zbl 0925.68144] \textit{Sivabalan, M.; Tavares, S. E.; Peppard, L. E.}, On the design of SP networks from an information theoretic point of view, 260-279 [Zbl 0925.94092] \textit{Carlet, Claude}, Partially-bent functions, 280-291 [Zbl 0817.94012] \textit{Zheng, Yuliang; Seberry, Jennifer}, Practical approaches to attaining security against adaptively chosen ciphertext attacks (extended abstract), 292-304 [Zbl 0818.94016] \textit{Baritaud, Thierry; Campana, Mireille; Chauvaud, Pascal; Gilbert, Henri}, On the security of the permuted kernel identification scheme, 305-311 [Zbl 0925.94093] \textit{Gordon, Daniel M.; McCurley, Kevin S.}, Massively parallel computation of discrete logarithms, 312-323 [Zbl 0813.94007] \textit{Peralta, René}, A quadratic sieve on the \(n\)-dimensional cube, 324-332 [Zbl 0816.11067] \textit{Meier, Willi; Staffelbach, Othmar}, Efficient multiplication on certain nonsupersingular elliptic curves, 333-344 [Zbl 0817.94015] \textit{Koyama, Kenji; Tsuruoka, Yukio}, Speeding up elliptic cryptosystems by using a signed binary window method, 345-357 [Zbl 0816.94016] \textit{Brandt, Jørgen; Damgård, Ivan}, On generation of probable primes by incremental search, 358-370 [Zbl 0820.11076] \textit{Fellows, Michael; Koblitz, Neal}, Kid Krypto, 371-389 [Zbl 0925.94088] \textit{Bellare, Mihir; Goldreich, Oded}, On defining proofs of knowledge, 390-420 [Zbl 0823.94016] \textit{Herzberg, Amir; Luby, Michael}, Public randomness in cryptography, 421-432 [Zbl 0817.94013] \textit{Russell, Alexander}, Necessary and sufficient conditions for collision-free hashing, 433-441 [Zbl 0817.94014] \textit{Bellare, Mihir; Yung, Moti}, Certifying cryptographic tools: The case of trapdoor permutations, 442-460 [Zbl 0817.94011] \textit{Maurer, Ueli M.}, Protocols for secret key agreement by public discussion based on common information, 461-470 [Zbl 0925.94097] \textit{Blundo, Carlo; De Santis, Alfredo; Herzberg, Amir; Kutten, Shay; Vaccaro, Ugo; Yung, Moti}, Perfectly-secure key distribution for dynamic conferences, 471-486 [Zbl 0816.94014] \textit{Biham, Eli; Shamir, Adi}, Differential cryptanalysis of the full 16-round DES, 487-496 [Zbl 0809.94017] \textit{Knudsen, Lars Ramkilde}, Iterative characteristics of DES and \(s^ 2\)-DES, 497-511 [Zbl 0809.94018] \textit{Campbell, Keith W.; Wiener, Michael J.}, DES is not a group, 512-520 [Zbl 0938.68633] \textit{Eberle, Hans}, A high-speed DES implementation for network applications, 521-539 [Zbl 0938.68628] \textit{Blakley, Bob; Blakley, G. R.; Chan, A. H.; Massey, J. L.}, Threshold schemes with disenrollment, 540-548 [Zbl 0809.94016] \textit{Frankel, Yair; Desmedt, Yvo; Burmester, Mike}, Non-existence of homomorphic general sharing schemes for some key spaces, 549-557 [Zbl 0809.94015] \textit{Harn, Lein; Lin, Hung-Yu}, An \(l\)-span generalized secret sharing scheme, 558-565 [Zbl 0809.94014] \textit{Nyberg, Kaisa; Knudsen, Lars Ramkilde}, Provable security against differential cryptanalysis, 566-574 [Zbl 0824.68037] \textit{Wayner, Peter C.}, Content-addressable search engines and DES-like systems, 575-586 [Zbl 0938.68632] \textit{Vaudenay, Serge}, FFT-Hash-II is not yet collision-free, 587-593 [Zbl 0809.94019]