内容

目次

Minimizing the use of random oracles in authenticated encryption schemes.- Zero-knowledge proofs of decision power: New protocols and optimal round-complexity.- Computational learning theoreitc cryptanalysis of language theoretic cryptosystems.- A language for specifying sequences of authorization transformations and its applications.- On the decomposition constructions for perfect secret sharing schemes.- Traceable visual cryptography.- Remarks on the multiple assignment secret sharing scheme.- Secret sharing in hierarchical groups.- Stateless connections.- Design of a security platform for CORBA based application.- Secure document management and distribution in an open network environment.- A 2-code = Affine resolvable + BIBD.- Multisender authentication systems with unconditional security.- Proposal of user identification scheme using mouse.- An effective genetic algorithm for finding highly nonlinear boolean functions.- Duality of Boolean functions and its cryptographic significance.- Construction of correlation immune Boolean functions.- An improved key stream generator based on the programmable cellular automata.- A trust policy framework.- Critical analysis of security in voice hiding techniques.- Two efficient RSA multisignature schemes.- Proxy signatures, revisited.- Related-key cryptanalysis of 3-WAY, Biham-DES,CAST, DES-X, NewDES, RC2, and TEA.- A multiplication-addition structure against differential attack.- On strict estimation method of provable security against differential and linear cryptanalysis.- Improved fast software implementation of block ciphers (Extended abstract).- Security comments on the Hwang-Chen algebraic-code cryptosystem.- Efficient elliptic curve exponentiation.- Efficient construction of secure hyperelliptic discrete logarithm problems.- A new and optimal chosen-message attack on RSA-type cryptosystems.- On weak RSA-keys produced from pretty good privacy.- Self-synchronized message randomization methods for subliminal channels.- Hiding the hidden: A software system for concealing ciphertext as innocuous text.- Digital signature and public key cryptosystem in a prime order subgroup of Z n * .- Trapdoor one-way permutations and multivariate polynomials.- Asymmetric cryptography with S-Boxes Is it easier than expected to design efficient asymmetric cryptosystems?.- On the powerline system.- Making unfair a “Fair” blind signature scheme.- Enforcing traceability in software.- Publicly verifiable partial key escrow.- A secure code for recipient watermarking against conspiracy attacks by all users.- Protocols for Issuing public-key certificates over the Internet.- Distributed cryptographic function application protocols.- Fault tolerant anonymous channel.- An Implementable scheme for secure delegation of computing and data.- Electronic commerce with secure intelligent trade agents.- Efficient scalable fair cash with off-line extortion prevention.- An anonymous and undeniable payment scheme.