feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    gbv_1649275161
    Format: Online-Ressource
    ISBN: 9783540459613
    Series Statement: Lecture Notes in Computer Science 330
    Content: Key Distribution -- Key Agreements Based on Function Composition -- Security of Improved Identity-based Conference Key Distribution Systems -- Authentication -- Subliminal-free Authentication and Signature -- Zero-Knowledge Proofs of Identity and Veracity of Transaction Receipts -- Authentication Codes with Multiple Arbiters -- Some Constructions for Authentication - Secrecy Codes -- Efficient Zero-Knowledge Identification Scheme for Smart Cards -- Signatures -- A Smart Card Implementation of the Fiat-Shamir Identification Scheme -- Manipulations and Errors, Detection and Localization -- Privacy Protected Payments — Realization of a Protocol That Guarantees Payer Anonymity -- A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory -- A Generalized Birthday Attack -- Protocols -- An Interactive Data Exchange Protocol Based on Discrete Exponentiation -- Anonymous and Verifiable Registration in Databases -- Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA -- Passports and Visas Versus IDs -- Complexity and Number Theory -- The Probabilistic Theory of Linear Complexity -- A Probabilistic Primality Test Based on the Properties of Certain Generalized Lucas Numbers -- On the Construction of Random Number Generators and Random Function Generators -- Numerical Methods -- Factorization of Large Integers on a Massively Parallel Computer -- A Fast Modular Arithmetic Algorithm Using a Residue Table -- Fast Exponentiation in GF(2n) -- Fast RSA-Hardware: Dream or Reality? -- Cryptanalysis -- Properties of the Euler Totient Function Modulo 24 and Some of Its Cryptographic Implications -- An Observation on the Security of McEliece’s Public-Key Cryptosystem -- How to Break Okamoto’s Cryptosystem by Reducing Lattice Bases -- Cryptanalysis of F.E.A.L. -- Fast Correlation Attacks on Stream Ciphers -- Running-Key Ciphers -- A New Class of Nonlinear Functions for Running-key Generators -- Windmill Generators A generalization and an observation of how many there are -- Lock-in Effect in Cascades of Clock-Controlled Shift-Registers -- Proof of Massey’s Conjectured Algorithm -- Linear Recurring m-Arrays -- Cipher Theory and Threshold -- Substantial Number of Cryptographic Keys and Its Application to Encryption Designs -- A Measure of Semiequivocation -- Some New Classes of Geometric Threshold Schemes -- New Ciphers -- A Universal Algorithm for Homophonic Coding -- A New Probabilistic Encryption Scheme -- Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption -- Some Applications of Multiple Key Ciphers.
    Content: The International .4ssociation for Cryptologic Research (1.4CR) organizes tmo - ternational conferences every year, one in Europe and one in the 1-nited States. EUROCRYI’T’88. held in the beautiful environment of the S\~isb mountains in Davos, was the sixth European conference. The number of contributions and of participants at the meeting has increased substantiall!.. which is an indication of the high interest in cryptography and system security in general. The interest has not only increased but has also further moved towards - thentication. signatures and other protocols. This is easy to understand in view of the urgent needs for such protocols, in particular in connection with open - formation systems, and in view of the exciting problems in this area. The equally fascinating classical field of secrecy, 2.e. the theory, design and analysis of stream or block ciphers and of public key cryptosystems. was however also well represented and several significant results mere communicated. The present proceedings contain all contributions which were accepted for presentation. The chapters correspond to the sessions at the conference.
    Note: Literaturangaben
    Additional Edition: ISBN 9783540502517
    Additional Edition: Buchausg. u.d.T. Davos, Switzerland, May 25 - 27, 1988 1988 ISBN 3540502513
    Additional Edition: ISBN 0387502513
    Additional Edition: Druckausg. Advances in cryptology - EUROCRYPT '88 Berlin [u.a.] : Springer, 1988 ISBN 3540502513
    Additional Edition: ISBN 0387502513
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    gbv_1650981856
    Format: Online-Ressource
    ISBN: 9783540386209
    Series Statement: Lecture Notes in Computer Science 106
    Content: Lexical elements -- Declarations and types -- Names and expressions -- Statements -- Subprograms -- Packages -- Visibility rules -- Tasks -- Program structure and compilation issues -- Exceptions -- Generic program units -- Representation specifications and implementation dependent features -- Input-output.
    Note: Literaturangaben
    Additional Edition: ISBN 9783540106937
    Additional Edition: Buchausg. u.d.T. The programming language Ada Berlin : Springer, 1981 ISBN 3540106936
    Additional Edition: ISBN 0387106936
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Ada ; Ada ; Aufsatzsammlung
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    gbv_1650981848
    Format: Online-Ressource
    ISBN: 9783540468417
    Series Statement: Lecture Notes in Computer Science 155
    Content: Lexical elements -- Declarations and types -- Names and expressions -- Statements -- Subprograms -- Packages -- Visibility rules -- Tasks -- Program structure and compilation issues -- Exceptions -- Generic units -- Representation clauses and implementation-dependent features -- Input-output.
    Additional Edition: ISBN 9783540123286
    Additional Edition: Buchausg. u.d.T. The programming language ADA Berlin : Springer, 1983 ISBN 3540123288
    Additional Edition: ISBN 0387123288
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Ada ; Ada ; Norm
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almafu_9959186231802883
    Format: 1 online resource (XVI, 148 p.)
    Edition: 1st ed. 1987.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48043-9
    Series Statement: Lecture Notes in Computer Science, 288
    Content: The book is devoted to a simplified set-theoretic version of denotational semantics where sets are used in place of Scott's reflexive domains and where jumps are described without continuations. This approach has emerged as a reaction to the sophisticated model of traditional semantics. It was also strongly stimulated by the applications of denotational semantics and especially by its software-industry oriented version known as VDM (Vienna Development Method). The new approach was successfully tested on several examples. Based on this approach the Polish Academy of Sciences created the project MetaSoft aimed at the development of a definitional metalanguage for software engineering. The approach has also been chosen in the project RAISE (ESPRIT) which aims at a similar goal. The book consists of two parts. Part One is devoted to the mathematical foundations of the future definitional metalanguage of MetaSoft. This part also introduces an appropriate notation. Part Two shows the applications of this metalanguage. There the denotational definition of a subset of Pascal is discussed with particular emphasis on Pascal types.
    Note: Bibliographic Level Mode of Issuance: Monograph , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-18657-3
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    almahu_9947920998002882
    Format: VI, 383 p. , online resource.
    ISBN: 9783540459613
    Series Statement: Lecture Notes in Computer Science, 330
    Content: The International .4ssociation for Cryptologic Research (1.4CR) organizes tmo - ternational conferences every year, one in Europe and one in the 1-nited States. EUROCRYI’T’88. held in the beautiful environment of the S\~isb mountains in Davos, was the sixth European conference. The number of contributions and of participants at the meeting has increased substantiall!.. which is an indication of the high interest in cryptography and system security in general. The interest has not only increased but has also further moved towards - thentication. signatures and other protocols. This is easy to understand in view of the urgent needs for such protocols, in particular in connection with open - formation systems, and in view of the exciting problems in this area. The equally fascinating classical field of secrecy, 2.e. the theory, design and analysis of stream or block ciphers and of public key cryptosystems. was however also well represented and several significant results mere communicated. The present proceedings contain all contributions which were accepted for presentation. The chapters correspond to the sessions at the conference.
    Note: Key Distribution -- Key Agreements Based on Function Composition -- Security of Improved Identity-based Conference Key Distribution Systems -- Authentication -- Subliminal-free Authentication and Signature -- Zero-Knowledge Proofs of Identity and Veracity of Transaction Receipts -- Authentication Codes with Multiple Arbiters -- Some Constructions for Authentication - Secrecy Codes -- Efficient Zero-Knowledge Identification Scheme for Smart Cards -- Signatures -- A Smart Card Implementation of the Fiat-Shamir Identification Scheme -- Manipulations and Errors, Detection and Localization -- Privacy Protected Payments — Realization of a Protocol That Guarantees Payer Anonymity -- A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory -- A Generalized Birthday Attack -- Protocols -- An Interactive Data Exchange Protocol Based on Discrete Exponentiation -- Anonymous and Verifiable Registration in Databases -- Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA -- Passports and Visas Versus IDs -- Complexity and Number Theory -- The Probabilistic Theory of Linear Complexity -- A Probabilistic Primality Test Based on the Properties of Certain Generalized Lucas Numbers -- On the Construction of Random Number Generators and Random Function Generators -- Numerical Methods -- Factorization of Large Integers on a Massively Parallel Computer -- A Fast Modular Arithmetic Algorithm Using a Residue Table -- Fast Exponentiation in GF(2n) -- Fast RSA-Hardware: Dream or Reality? -- Cryptanalysis -- Properties of the Euler Totient Function Modulo 24 and Some of Its Cryptographic Implications -- An Observation on the Security of McEliece’s Public-Key Cryptosystem -- How to Break Okamoto’s Cryptosystem by Reducing Lattice Bases -- Cryptanalysis of F.E.A.L. -- Fast Correlation Attacks on Stream Ciphers -- Running-Key Ciphers -- A New Class of Nonlinear Functions for Running-key Generators -- Windmill Generators A generalization and an observation of how many there are -- Lock-in Effect in Cascades of Clock-Controlled Shift-Registers -- Proof of Massey’s Conjectured Algorithm -- Linear Recurring m-Arrays -- Cipher Theory and Threshold -- Substantial Number of Cryptographic Keys and Its Application to Encryption Designs -- A Measure of Semiequivocation -- Some New Classes of Geometric Threshold Schemes -- New Ciphers -- A Universal Algorithm for Homophonic Coding -- A New Probabilistic Encryption Scheme -- Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption -- Some Applications of Multiple Key Ciphers.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540502517
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9948621524302882
    Format: XVI, 148 p. , online resource.
    Edition: 1st ed. 1987.
    ISBN: 9783540480433
    Series Statement: Lecture Notes in Computer Science, 288
    Content: The book is devoted to a simplified set-theoretic version of denotational semantics where sets are used in place of Scott's reflexive domains and where jumps are described without continuations. This approach has emerged as a reaction to the sophisticated model of traditional semantics. It was also strongly stimulated by the applications of denotational semantics and especially by its software-industry oriented version known as VDM (Vienna Development Method). The new approach was successfully tested on several examples. Based on this approach the Polish Academy of Sciences created the project MetaSoft aimed at the development of a definitional metalanguage for software engineering. The approach has also been chosen in the project RAISE (ESPRIT) which aims at a similar goal. The book consists of two parts. Part One is devoted to the mathematical foundations of the future definitional metalanguage of MetaSoft. This part also introduces an appropriate notation. Part Two shows the applications of this metalanguage. There the denotational definition of a subset of Pascal is discussed with particular emphasis on Pascal types.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662186220
    Additional Edition: Printed edition: ISBN 9783540186571
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    edocfu_9959186231802883
    Format: 1 online resource (XVI, 148 p.)
    Edition: 1st ed. 1987.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48043-9
    Series Statement: Lecture Notes in Computer Science, 288
    Content: The book is devoted to a simplified set-theoretic version of denotational semantics where sets are used in place of Scott's reflexive domains and where jumps are described without continuations. This approach has emerged as a reaction to the sophisticated model of traditional semantics. It was also strongly stimulated by the applications of denotational semantics and especially by its software-industry oriented version known as VDM (Vienna Development Method). The new approach was successfully tested on several examples. Based on this approach the Polish Academy of Sciences created the project MetaSoft aimed at the development of a definitional metalanguage for software engineering. The approach has also been chosen in the project RAISE (ESPRIT) which aims at a similar goal. The book consists of two parts. Part One is devoted to the mathematical foundations of the future definitional metalanguage of MetaSoft. This part also introduces an appropriate notation. Part Two shows the applications of this metalanguage. There the denotational definition of a subset of Pascal is discussed with particular emphasis on Pascal types.
    Note: Bibliographic Level Mode of Issuance: Monograph , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-18657-3
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    edoccha_9959186231802883
    Format: 1 online resource (XVI, 148 p.)
    Edition: 1st ed. 1987.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48043-9
    Series Statement: Lecture Notes in Computer Science, 288
    Content: The book is devoted to a simplified set-theoretic version of denotational semantics where sets are used in place of Scott's reflexive domains and where jumps are described without continuations. This approach has emerged as a reaction to the sophisticated model of traditional semantics. It was also strongly stimulated by the applications of denotational semantics and especially by its software-industry oriented version known as VDM (Vienna Development Method). The new approach was successfully tested on several examples. Based on this approach the Polish Academy of Sciences created the project MetaSoft aimed at the development of a definitional metalanguage for software engineering. The approach has also been chosen in the project RAISE (ESPRIT) which aims at a similar goal. The book consists of two parts. Part One is devoted to the mathematical foundations of the future definitional metalanguage of MetaSoft. This part also introduces an appropriate notation. Part Two shows the applications of this metalanguage. There the denotational definition of a subset of Pascal is discussed with particular emphasis on Pascal types.
    Note: Bibliographic Level Mode of Issuance: Monograph , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-18657-3
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages