Abstract
OSIS is a research project to provide an open and secure market for information services communicated via computer networks by developing a communication and payment system. Inspite of worldwide efforts to facilitate inter-network communication by standardisation, such as the Open Systems Interconnection model (OSI) of the International Organisation for Standardisation (ISO), the market for information communicated via networks remains still closed. This is due to the fact that only registered users will be admitted by the information service suppliers to access the information facilities they provide. Anonymous business cannot be supported because of the need for registration. The community of service suppliers is not aware of the technical possibilities that state of the art technology provides. OSIS aims to close that gap and to open the market by providing the customers and service suppliers with the digital signature facility to sign orders, acknowledge oders, requests for payments, payments, etc.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Leonard M. Adleman: A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography; in: Proc. IEEE 20th Annual Symposium on Foundation of Computer Science, Oct.1979, p.55-60
Leonard M. Adleman; Carl Pomerance; Robert S. Rumely: On Distinguishing Prime Numbers from Composite Numbers; in: Annals of Mathematics, Vol.117, 1983, p.173–206
Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms; Eddison-Wesley; 1976
Herbert Burkert: OSIS and the Legal Environment, Draft 0SIS-WG3-E, 85-06-10
David L. Chaum: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms; in: CACM, Vol.24, No.2, February 1981, p.84–88; ACM, Inc.; New York
David Chaum: A New Paradigm for the Individuals in the Information Age: Cryptographic Systems for Pseudonymous Communication, Payments, and Credentials; in: Proc. Symposium on Security and Privacy, 1984, Oakland, p.99-103
D.W. Davies; W.L. Price: Security for Computer Networks: An Introduction to Data Security in Teleprocessing and Electronic Funds Transfer; John Wiley & Sons; 1984
D.W. Davies: A Hash function using modular arithmetic: contribution to ICCC′84 (7th International Conference on Computer Communication), Sidney
Dorothy E. Denning; Giovanni Maria Sacco: Timestamps in Key Distribution Protocols; in: CACM, Vol.24, No.8, August 1981, p.533–536
Dorothy E. Denning: Cryptography and Data Security; Addison-Wesley Publ. Co.; 1982
Dorothy E. Denning: Protecting Public Keys and Signature Keys; in: IEEE Computer, Vol.16, No.2, February 1983, p.27–35
Dorothy E. Denning: Digital Signatures with RSA and Other Public-Key Cryptosystems; in: CACM, Vol.27, No.4, April 1984, p.388–392
Whitfield Diffie; Martin E. Hellman: New Directions in Cryptography; in: IEEE Transactions on Information Theory, Vol.IT-22, No.6, Nov.1976, p.644–654
R.C. Fairfield; R.L. Mortenson; K.B. Coulthart: An LSI Random Number Generator (RNG); in: Advances in Cryptology: Proc. CRYPTO 84 (Blakley; Chaum eds), Lecture Notes in Computer Science No.196, p.203-230; Springer-Verlag; 1985
Tore Herlestam: Critical Remarks on Some Public Key Cryptosystems; in: BIT, Vol.18, No.4, 1978, p.493–496 (cf. R. Rivest: Critical Remarks on ‘Critical Remarks …’, in: BIT, Vol.19, 1979, p.274-275)
R.R. Jueneman; S.M. Matyas; C.H. Meyer: Message Authentication with Manipulation Detection Codes; in: Proc. Security & Privacy 1983, p.33-54, IEEE Catalog No. 83CH1882-0
Abraham Lempel: Cryptology in Transition; in: ACM Computing Surveys, Vol.11, No.4, Dec. 1979, p.285–303
Donald E. Knuth: The Art of Computer Programming: Volume 2/ Seminumerical Algorithms; Addison-Wesley Publ. Comp.; 1981, 2nd ed.
M.A. Morrison; J Brillnart: A method for factoring and the factorization of F7; in: Mathematics of Computation, Vol.29, 1975, p.183–205
Christian Müller-Schloer: A Microprocessor-based Cryptoprocessor; in: IEEE Micro, Vol.3, No.5, Oct.1983, p.5–15
National Bureau of Standards (US),: Data Encryption Standard (DES); NBS; Washington, D.C.; 1977; FIPS PUB 46
J.M. Pollard: A Monte Carlo method for factorization; in: BIT, Vol.15, 1975, p.331–334
Carl Pomerance: On the Distribution of Pseudoprimes; in: Mathematics of Computation, Vol.37, No.156, Oct.1981, p.587–593
Michael O. Rabin: Probabilistic Algorithm for Testing Primality; in: Journal of Number Theory, Vol.12, No.1, Feb. 1980, p.128–138
Ronald L. Rivest; Adi Shamir; Leonard Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems; in: CACM, Vol.21, No.2, February 1978, p.120–125
Ronald L. Rivest: Remarks on a Proposed Cryptanalytic Attack on the M.I.T. Public-Key Cryptosystem; in: Cryptologia, Vol.2, No.1, 1978, p.62–65
Ronald L. Rivest; Adi Shamir: How to Expose an Eavesdropper; in: CACM, Vol.27, No.4, April 1984, p.393–395
J. Sattler; C.P. Schnorr: Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillnart und Schroeppel; in: Computing, Vol.30, 1983, p.91–110
Adi Shamir: Identity-Based Cryptosystems and Signature Schemes; in: Advances in Cryptology: Proc. CRYPTO 84 (Blakley; Chaum eds), Lecture Notes in Computer Science No.196, p.47-53; Springer-Verlag; 1985
Gustavus J. Simmons; Michael J. Norris: Preliminary Comments on the M.I.T. Public-Key Cryptosystem; in: Cryptologia, Vol.1, No.4, Oct.1877, p.406–414
R. Solovay; V. Strassen: A Fast Monte-Carlo Test for Primality; in: SIAM Journal on Computing, Vol.6, No.1, March 1977, p.84–85
H.C. Williams; B. Schmid: Some Remarks Concerning the M.I.T. Public-Key Cryptosystem; in: BIT, Vol.19, 1979, p.525–538
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herda, S. (1985). Authenticity, Anonymity and Security in Osis. In: Spies, P.P. (eds) Datenschutz und Datensicherung im Wandel der Informationstechnologien. Informatik-Fachberichte, vol 113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-70865-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-70865-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16036-6
Online ISBN: 978-3-642-70865-7
eBook Packages: Springer Book Archive