1 option
Information and Communications Security : First International Conference, ICIS'97, Beijing, China, November 11-14, 1997, Proceedings / edited by Yongfei Han, Tatsuaki Okamoto, Sihan Quing.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1334.
- Lecture Notes in Computer Science, 0302-9743 ; 1334
- Language:
- English
- Subjects (All):
- Data encryption (Computer science).
- Coding theory.
- Information theory.
- Computer networks.
- Management information systems.
- Computer science.
- Electrical engineering.
- Cryptology.
- Coding and Information Theory.
- Computer Communication Networks.
- Management of Computing and Information Systems.
- Communications Engineering, Networks.
- Local Subjects:
- Cryptology.
- Coding and Information Theory.
- Computer Communication Networks.
- Management of Computing and Information Systems.
- Communications Engineering, Networks.
- Physical Description:
- 1 online resource (X, 486 pages).
- Edition:
- First edition 1997.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the First International Conference on Information and Communication Security, ICICS '97, held in Beijing, China in November 1997. The 37 revised full papers presented were selected from a total of 87 submissions. Also included are 11 short papers. The book is divided in sections on theoretical foundations of security, secret sharing, network security, authentication and identification, Boolean functions and stream ciphers, security evaluation, signatures, public key systems, cryptanalysis of public key systems, subliminal channels, key recovery, intellectual property protection, protocols, and electronic commerce.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69628-5
- 9783540696285
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.