UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Lectures on Data Security: Modern Cryptology in Theory and Practice

1, 1999

Volltextzugriff (PDF)

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions

Advances in Cryptology - EUROCRYPT 2015, p.313-336

Volltextzugriff (PDF)

Advances in Cryptology - EUROCRYPT '90: Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings

1, 1991

Volltextzugriff (PDF)

Advances in Cryptology - EUROCRYPT '90: Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings

Damgard, Ivan B

1991 edition., 2003

Volltextzugriff (PDF)

Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers

Fundamentals of Computation Theory, 2003, p.109-117

2003

Volltextzugriff (PDF)

Commitment Schemes and Zero-Knowledge Protocols

Lecture notes in computer science, 2003, p.63-86

2003

Volltextzugriff (PDF)

Collision Free Hash Functions and Public Key Signature Schemes

Advances in Cryptology — EUROCRYPT’ 87, p.203-216

Volltextzugriff (PDF)

On The Randomness of Legendre and Jacobi Sequences

Advances in Cryptology — CRYPTO’ 88, p.163-172

Volltextzugriff (PDF)

Practice-Oriented Provable-Security

Lecture notes in computer science, 2003, p.1-15

2003

Volltextzugriff (PDF)

A Proposal for a New Block Encryption Standard

Advances in Cryptology — EUROCRYPT ’90, p.389-404

Volltextzugriff (PDF)

Zero-Knowledge Undeniable Signatures (extended abstract)

Advances in Cryptology — EUROCRYPT ’90, p.458-464

Volltextzugriff (PDF)

A Design Principle for Hash Functions

Advances in Cryptology — CRYPTO’ 89 Proceedings, p.416-427

Volltextzugriff (PDF)

Propagation Characteristics of Boolean Functions

Advances in Cryptology — EUROCRYPT ’90, p.161-173

Volltextzugriff (PDF)

Contemporary Block Ciphers

Lecture notes in computer science, 2003, p.105-126

2003

Volltextzugriff (PDF)

Primality Tests and Use of Primes in Public Key Systems

Lecture notes in computer science, 2003, p.127-133

2003

Volltextzugriff (PDF)

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers

Journal of symbolic computation, 2005-06, Vol.39 (6), p.643-652

2005

Volltextzugriff (PDF)

A Cryptographic Library for the Motorola DSP56000

Advances in Cryptology — EUROCRYPT ’90, p.230-244

Volltextzugriff (PDF)

Practical and provably secure release of a secret and exchange of signatures

Journal of cryptology, 1995-09, Vol.8 (4), p.201-222

Damgård, Ivan Bjerre

1995

Volltextzugriff (PDF)

On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2

Advances in Cryptology — EUROCRYPT ’90, 1991, Vol.473 LNCS, p.306-312

1991

Volltextzugriff (PDF)

Fast Signature Generation with a Fiat Shamir — Like Scheme

Advances in Cryptology — EUROCRYPT ’90, p.432-440

Volltextzugriff (PDF)

An identity-based identification scheme based on discrete logarithms modulo a composite number

Advances in Cryptology — EUROCRYPT ’90, p.481-486

Volltextzugriff (PDF)

A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party

Advances in Cryptology — EUROCRYPT ’90, p.266-282

Volltextzugriff (PDF)

Constructions of bent functions and difference sets

Advances in Cryptology — EUROCRYPT ’90, p.151-160

Volltextzugriff (PDF)

Lower Bounds for the Linear Complexity of Sequences over Residue Rings

Advances in Cryptology — EUROCRYPT ’90, p.189-195

Volltextzugriff (PDF)

How to Construct Pseudorandom Permutations from Single Pseudorandom Functions

Advances in Cryptology — EUROCRYPT ’90, p.140-150

Volltextzugriff (PDF)

1 – 25 von 84

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(67)
Mit Volltextzugriff
(79)

Publikationsform

Sprache

Englisch
(84)
Japanisch
(5)

Erscheinungsjahr

n.n

Thema

Computer Science
(52)
Computer Science, Theory & Methods
(49)
Science & Technology
(49)
Technology
(49)
Cryptography
(10)
Signature Scheme
(10)
Applied Sciences
(7)
Exact Sciences And Technology
(7)
Hash Function
(6)
Information, Signal And Communications Theory
(5)
Signal And Communications Theory
(5)
Telecommunications And Information Theory
(5)
Commitment Scheme
(4)
Oblivious Transfer
(4)
Quadratic Residue
(4)
Access Control
(3)
Algorithms
(3)
Block Cipher
(3)
Computers
(3)
Data Encryption
(3)

15 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

Menü

Weitere Dienste

Einstellungen

Lectures on Data Security: Modern Cryptology in Theory and Practice

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions

Advances in Cryptology - EUROCRYPT '90: Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings

Advances in Cryptology - EUROCRYPT '90: Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings

Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers

Commitment Schemes and Zero-Knowledge Protocols

Collision Free Hash Functions and Public Key Signature Schemes

On The Randomness of Legendre and Jacobi Sequences

Practice-Oriented Provable-Security

A Proposal for a New Block Encryption Standard

Zero-Knowledge Undeniable Signatures (extended abstract)

A Design Principle for Hash Functions

Propagation Characteristics of Boolean Functions

Contemporary Block Ciphers

Primality Tests and Use of Primes in Public Key Systems

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers

A Cryptographic Library for the Motorola DSP56000

Practical and provably secure release of a secret and exchange of signatures

On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2

Fast Signature Generation with a Fiat Shamir — Like Scheme

An identity-based identification scheme based on discrete logarithms modulo a composite number

A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party

Constructions of bent functions and difference sets

Lower Bounds for the Linear Complexity of Sequences over Residue Rings

How to Construct Pseudorandom Permutations from Single Pseudorandom Functions

Suchergebnisse filtern