


default search action
1. ICICS 1997: Beijing, China
- Yongfei Han, Tatsuaki Okamoto, Sihan Qing:
Information and Communication Security, First International Conference, ICICS'97, Beijing, China, November 11-14, 1997, Proceedings. Lecture Notes in Computer Science 1334, Springer 1997, ISBN 3-540-63696-X
Session 1: Theoretical Foundations of Security
- Mihir Bellare, Phillip Rogaway:
Minimizing the use of random oracles in authenticated encryption schemes. 1-16 - Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung:
Zero-knowledge proofs of decision power: new protocols and optimal round-complexity. 17-27 - Takeshi Koshiba:
Computational learning theoretic cryptanalysis of language theoretic cryptosystems. 28-38 - Yun Bai, Vijay Varadharajan:
A language for specifying sequences of authorization transformations and its applications. 39-49
Session 2: Secret Sharing
- Hung-Min Sun, Bor-Liang Chen:
On the decomposition constructions for perfect secret sharing schemes. 50-60 - Ingrid Biehl, Susanne Wetzel:
Traceable visual cryptography. 61-71 - Hossein Ghodosi, Josef Pieprzyk, Reihaneh Safavi-Naini:
Remarks on the multiple assignment secret sharing scheme. 72-80 - Chris Charnes, Keith M. Martin, Josef Pieprzyk, Reihaneh Safavi-Naini:
Secret sharing in hierarchical groups. 81-86
Session 3: Network Security
- Tuomas Aura, Pekka Nikander:
Stateless connections. 87-97 - Rakman Choi, Jung-Chan Na, Kwonil Lee, Eunmi Kim, Wooyong Han:
Design of a security platform for CORBA based application. 98-108 - Antonio Lioy, Fabio Maino, Marco Mezzalama:
Secure document management and distribution in an open network environment. 109-117
Session 4: Authentication and Identification
- Satoshi Obana, Kaoru Kurosawa:
A2-code = Affine resolvable = BIBD. 118-129 - Keith M. Martin, Reihaneh Safavi-Naini:
Multisender authentication systems with unconditional security. 130-143 - Kenichi Hayashi, Eiji Okamoto, Masahiro Mambo:
Proposal of user identification scheme using mouse. 144-148
Session 5: Boolean Functions and Stream Ciphers
- William Millan, Andrew J. Clark, Ed Dawson:
An effective genetic algorithm for finding highly nonlinear Boolean Functions. 149-158 - Xian-Mo Zhang, Yuliang Zheng, Hideki Imai:
Duality of Boolean functions and its cryptographic significance. 159-169 - Ed Dawson, Chuan-Kun Wu:
Construction of correlation immune Boolean functions. 170-180 - Miodrag J. Mihaljevic:
An improved key stream generator based on the programmable cellular automata. 181-191
Session 6: Security Evaluation
- Audun Jøsang:
A Trust policy framework. 192-202 - Liwu Chang, Ira S. Moskowitz:
Critical analysis of security in voice hiding techniques. 203-216
Session 7: Signatures
- Sangjoon Park, Sangwoo Park, Kwangjo Kim, Dongho Won:
Two efficient RSA multisignature schemes. 217-222 - Seungjoo Kim, Sangjoon Park, Dongho Won:
Proxy signatures, Revisited. 223-232
Session 8: Block Ciphers
- John Kelsey
, Bruce Schneier, David A. Wagner:
Related-key cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA. 233-246 - Feng Zhu, Bao-An Guo:
A multiplication-addition structure against differential attack. 247-257 - Yasuyoshi Kaneko, Shiho Moriai, Kazuo Ohta:
On strict estimation method of provable security against differential and linear cryptanalysis. 258-268 - Takeshi Shimoyama, Seiichi Amada, Shiho Moriai:
Improved fast software implementation of block ciphers. 269-273 - Mohssen Alabbadi:
Security comments on the Hwang-Chen algebraic-code cryptosystem. 274-281
Session 9: Public Key Systems 1
- Atsuko Miyaji, Takatoshi Ono, Henri Cohen:
Efficient elliptic curve exponentiation. 282-291 - Jinhui Chao, Nori Matsuda, Shigeo Tsujii:
Efficient construction of secure hyperelliptic discrete logarithm problems. 292-301
Session 10: Cryptanalysis of Public Key Systems
- Daniel Bleichenbacher, Marc Joye, Jean-Jacques Quisquater:
A new and optimal chosen-message attack on RSA-type cryptosystems. 302-313 - Yasuyuki Sakai, Kouichi Sakurai, Hirokazu Ishizuka:
On weak RSA-keys produced from Pretty Good Privacy. 314-324
Session 11: Subliminal Channels
- Kazukuni Kobara, Hideki Imai:
Self-synchronized message randomization methods for subliminal channels. 325-334 - Mark Chapman, George I. Davida:
Hiding the Hidden: A software system for concealing ciphertext as innocuous text. 335-345
Session 12: Public Key Systems 2
- Colin Boyd:
Digital signature and public key cryptosystems in a prime order subgroup of Zn*. 346-355 - Jacques Patarin, Louis Goubin:
Trapdoor one-way permutations and multivariate polynominals. 356-368 - Jacques Patarin, Louis Goubin:
Asymmetric cryptography with S-Boxes. 369-380 - Paul Camion, Hervé Chabanne:
On the powerline system. 381-385
Session 13: Key Recovery/Fair Cryptosystem
- Jacques Traoré:
Making unfair a "fair" blind signature scheme. 386-397 - Colin Boyd:
Enforcing traceability in software. 398-408 - Wenbo Mao:
Publicly verifiable partial key escrow. 409-413
Session 14: Intellectual Property Protection
- Hajime Watanabe, Tadao Kasami:
A secure code for recipient watermarking against conspiracy attacks by all users. 414-423
Session 15: Protocols
- James W. Gray III, Kin Fai Epsilon Ip:
Protocols for issuing public-key certificates over the Internet. 424-434 - André Postma, Thijs Krol, Egbert Molenkamp:
Distributed cryptographic function application protocols. 435-439 - Wakaha Ogata
, Kaoru Kurosawa, Kazue Sako, Kazunori Takatani:
Fault tolerant anonymous channel. 440-444 - Josep Domingo-Ferrer, Ricardo X. Sanchez del Castillo:
An implementable scheme for secure delegation of computing and data. 445-451
Session 16: Electronic Commerce
- Jacobus E. van der Merwe, Sebastiaan H. von Solms:
Electronic commerce with secure intelligent trade agent. 452-462 - Holger Peterson, Guillaume Poupard:
Efficient scalable fair cash with off-line extortion prevention. 463-477 - Liqun Chen, Chris J. Mitchell
:
An anonymous and undeniable payment scheme. 478-482

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.