The SCEAS System
Navigation Menu

Conferences in DBLP

EUROCRYPT (eurocrypt)
1990 (conf/eurocrypt/90)

  1. Mike Burmester
    Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:1-10 [Conf]
  2. George I. Davida, Yvo Desmedt, René Peralta
    On the Importance of Memory Resources in the Security of Key Exchange Protocols. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:11-15 [Conf]
  3. S. Shinozaki, Toshiya Itoh, Atsushi Fujioka, Shigeo Tsujii
    Provably Secure Key-Updating Schemes in Identity-Based Systems. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:16-30 [Conf]
  4. Bert den Boer
    Oblivous Transfer Protecting Secrecy. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:31-45 [Conf]
  5. Alfredo De Santis, Giuseppe Persiano
    Public-Randomness in Public Key Cryptography. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:46-62 [Conf]
  6. Ernest F. Brickell, Kevin S. McCurley
    An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:63-71 [Conf]
  7. Arjen K. Lenstra, Mark S. Manasse
    Factoring With Two Large Primes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:72-82 [Conf]
  8. Jan-Hendrik Evertse, Eugène van Heyst
    Which New RSA Signatures Can Be Computed From Some Given RSA Signatures? [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:83-97 [Conf]
  9. Renate Scheidler, Johannes Buchmann, Hugh C. Williams
    Implementation of a Key Exchange Protocol Using Some Real Quadratic Fields. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:98-109 [Conf]
  10. François Morain
    Distributed Primality Proving and the Primality of (23539+1)/3. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:110-123 [Conf]
  11. Sheelagh Lloyd
    Properties of Binary Functions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:124-139 [Conf]
  12. Josef Pieprzyk
    How to Construct Pseudorandom Permutations from Single Pseudorandom Functions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:140-150 [Conf]
  13. Kaisa Nyberg
    Constructions of Bent Functions and Difference Sets. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:151-160 [Conf]
  14. Bart Preneel, Werner Van Leekwijck, Luc Van Linden, René Govaerts, Joos Vandewalle
    Propagation Characteristics of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:161-173 [Conf]
  15. Harald Niederreiter
    The Linear Complexity Profile and the Jump Complexity of Keystream Sequences. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:174-188 [Conf]
  16. Zong-Duo Dai, Thomas Beth, Dieter Gollmann
    Lower Bounds for the Linear Complexity of Sequences over Residue Rings. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:189-195 [Conf]
  17. Cees J. A. Jansen
    On the Construction of Run Permuted Sequences. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:196-203 [Conf]
  18. Willi Meier, Othmar Staffelbach
    Correlation Properties of Combiners with Memory in Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:204-213 [Conf]
  19. Agnes Hui Chan, Mark Goresky, Andrew Klapper
    Correlation Functions of Geometric Sequences. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:214-221 [Conf]
  20. Yacov Yacobi
    Exponentiating Faster with Addition Chains. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:222-229 [Conf]
  21. Stephen R. Dussé, Burton S. Kaliski Jr.
    A Cryptographic Library for the Motorola DSP56000. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:230-244 [Conf]
  22. Holger Orup, Erik Svendsen, Erik Andreasen
    VICTOR an Efficient RSA Hardware Implementation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:245-252 [Conf]
  23. Charles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin
    Experimental Quantum Cryptography. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:253-265 [Conf]
  24. Ingemar Ingemarsson, Gustavus J. Simmons
    A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:266-282 [Conf]
  25. Andrea Sgarro
    Lower Bounds for Authentication Codes With Splitting. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:283-293 [Conf]
  26. Albrecht Beutelspacher, Ute Rosenbaum
    Essentially l-Fold Secure Authentication Systems. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:294-305 [Conf]
  27. Ben J. M. Smeets, Peter Vanroose, Zhe-xian Wan
    On the Construction of Authentication Codes With Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:306-312 [Conf]
  28. Jacques Stern, Philippe Toffin
    Cryptanalysis of a Public-Key Cryptosystem Based on Approximations by Rational Numbers. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:313-317 [Conf]
  29. Paul C. van Oorschot, Michael J. Wiener
    A Known Plaintext Attack on Two-Key Triple Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:318-325 [Conf]
  30. Shoji Miyaguchi, Kazuo Ohta, Masahiko Iwata
    Confirmation that Some Hash Functions Are Not Collision Free. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:326-343 [Conf]
  31. Fritz Bauspieß, Hans-Joachim Knobloch, Peer Wichmann
    Inverting the Pseudo Exponentiation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:344-351 [Conf]
  32. Tzonelih Hwang
    Cryptosystem for Group Oriented Cryptography. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:352-360 [Conf]
  33. Ueli M. Maurer
    A Provably-Secure Strongly-Randomized Cipher. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:361-373 [Conf]
  34. Kaoru Kurosawa, Yutaka Katayama, Wakaha Ogata, Shigeo Tsujii
    General Public Key Residue Cryptosystems and Mental Poker Protocols. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:374-388 [Conf]
  35. Xuejia Lai, James L. Massey
    A Proposal for a New Block Encryption Standard. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:389-404 [Conf]
  36. Valtteri Niemi
    A New Trapdoor in Knapsacks. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:405-411 [Conf]
  37. Alfredo De Santis, Moti Yung
    On the Design of Provably Secure Cryptographic Hash Functions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:412-431 [Conf]
  38. H. Ong, Claus-Peter Schnorr
    Fast Signature Generation With a Fiat Shamir-Like Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:432-440 [Conf]
  39. Gerrit Bleumer, Birgit Pfitzmann, Michael Waidner
    A Remark on a Signature Scheme Where Forgery Can Be Proved. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:441-445 [Conf]
  40. Kazuo Ohta, Tatsuaki Okamoto, Kenji Koyama
    Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:446-457 [Conf]
  41. David Chaum
    Zero-Knowledge Undeniable Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:458-464 [Conf]
  42. Louis C. Guillou, Jean-Jacques Quisquater, Michael Walker, Peter Landrock, Caroline Shafer
    Precautions Taken Against Various Potential Attacks in ISO/IEC DIS 9796 "Digital Signature Scheme Giving Message Recovery". [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:465-473 [Conf]
  43. Josep Domingo-Ferrer
    Software Run-Time Protection: A Cryptographic Issue. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:474-480 [Conf]
  44. Marc Girault
    An Identity-based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:481-486 [Conf]
  45. Jovan Dj. Golic, Miodrag J. Mihaljevic
    A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparion Approach. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:487-491 [Conf]
  46. Burton S. Kaliski Jr.
    The MD4 Message Digest Algorithm (Abstract). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:492- [Conf]
  47. Mike Burmester
    A Remark on the Efficiency of Identification Schemes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:493-495 [Conf]
  48. Gisela Meister
    On an Implementation of the Mohan-Adiga Algorithm. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:496-500 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002