Advances in cryptology--EUROCRYPT '92: Workshop on the Theory and Application of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992 : proceedings
A series of workshops devoted to modern cryptography began in Santa Barbara,California in 1981 and was followed in 1982 by a European counterpart in Burg Feuerstein, Germany. The series has been maintained with summer meetings in Santa Barbara and spring meetings somewhere in Europe. At the 1983 meeting in Santa Barbara the International Association for Cryptologic Research was launched and it now sponsors all the meetings of the series. This volume presents the proceedings of Eurocrypt '92, held in Hungary. The papers are organized into the following parts: Secret sharing, Hash functions, Block ciphers, Stream ciphers, Public key I, Factoring, Trapdoor primes and moduli (panel report), Public key II, Pseudo-random permutation generators, Complexity theory and cryptography I, Zero-knowledge, Digital knowledge and electronic cash, Complexity theory andcryptography II, Applications, and selected papers from the rump session. Following the tradition of the series, the authors produced full papers after the meeting, in some cases with revisions.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Classification of ideal homomorphic threshold schemes
FFThash II efficient cryptographic hashing
25 other sections not shown
Other editions - View all
Advances in Cryptology — EUROCRYPT ’92: Workshop on the Theory and ...
Rainer A. Rueppel
No preview available - 1993
addition chain Advances in Cryptology adversary algorithm Alice attack binary block cipher bound circuit scale Computer Science construct Crypto cryptographic Cryptology cryptosystem defined definition denote discrete logarithm distinguishing circuit distribution efficient elliptic curve encryption exists exponent exponentiation factor fail-stop signatures finite given graph hash functions Hence IEEE implementation independent information rate input integer Lemma length linear m-bit method modular multiplication modulo non-interactive Oblivious Transfer obtain one-way function optimal oracle gates output polynomial preprocessing prime probabilistic Turing machine probability problem Proc processing speed processors proof system protocol prove pseudorandom function pseudorandom permutation public key random bits random function random variables result round function secret key secret sharing sends sequence sharing scheme signature scheme signer simulator smart card step string super pseudorandom permutation Theorem undeniable signature uooo uooo uooo vector verifier window values zero-knowledge proof ZKIP