You have Guest access.
Log In
Ivan Bjerre Damgård
Front matter
1-10
All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions Extended Abstract
11-15
On the Importance of Memory Resources in the Security of Key Exchange Protocols Extended Abstract
16-30
Provably Secure Key-Updating Schemes in Identity-Based Systems
31-45
Oblivious transfer protecting secrecy An implementation for oblivious transfer protecting secrecy almost unconditionally and a bitcommitment based on factoring protecting secrecy unconditionally
46-62
Public-Randomness in Public-Key Cryptography Extended Abstract
63-71
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring Extended Abstract
72-82
Factoring with two large primes Extended Abstract
83-97
Which new RSA signatures can be computed from some given RSA signatures? extended abstract
98-109
Implementation of a Key Exchange Protocol Using Real Quadratic Fields Extended Abstract
110-123
Distributed Primality Proving and the Primality of (23539 + 1)/3
124-139
Properties of binary functions
140-150
How to Construct Pseudorandom Permutations from Single Pseudorandom Functions
151-160
Constructions of bent functions and difference sets
161-173
Propagation Characteristics of Boolean Functions
174-188
The Linear Complexity Profile and the Jump Complexity of Keystream Sequences
189-195
Lower Bounds for the Linear Complexity of Sequences over Residue Rings
196-203
On the Construction of Run Permuted Sequences
204-213
Correlation Properties of Combiners with Memory in Stream Ciphers (Extended Abstract)
214-221
Correlation Functions of Geometric Sequences
222-229
Exponentiating Faster with Addition Chains
230-244
A Cryptographic Library for the Motorola DSP56000
245-252
VICTOR an efficient RSA hardware implementation
253-265
Experimental Quantum Cryptography
266-282
A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party
283-293
Lower Bounds for Authentication Codes with Splitting
294-305
Essentially ℓ -fold secure authentication systems
306-312
On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2
313-317
Cryptanalysis of a public-key cryptosystem based on approximations by rational numbers
318-325
A Known-Plaintext Attack on Two-Key Triple Encryption
326-343
Confirmation that Some Hash Functions Are Not Collision Free
344-351
Inverting the Pseudo Exponentiation
352-360
Cryptosystem for Group Oriented Cryptography
361-373
A Provably-Secure Strongly-Randomized Cipher
374-388
General public key residue cryptosystems and mental poker protocols
389-404
A Proposal for a New Block Encryption Standard
405-411
A new trapdoor in knapsacks
412-431
On the Design of Provably-Secure Cryptographic Hash Functions
432-440
Fast Signature Generation with a Fiat Shamir — Like Scheme
441-445
A Remark on a Signature Scheme Where Forgery can be Proved
446-457
Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme
458-464
Zero-Knowledge Undeniable Signatures (extended abstract)
465-473
Precautions taken against various potential attacks in ISO/IEC DIS 9796 “Digital signature scheme giving message recovery”
474-480
Software Run-Time Protection: A Cryptographic Issue
481-486
An identity-based identification scheme based on discrete logarithms modulo a composite number
487-491
A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparison Approach
492
The MD4 Message Digest Algorithm
493-495
A remark on the efficiency of identification schemes
496-500
On an Implementation of the Mohan-Adiga Algorithm
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info