AAAAAA

   
Results: 1-25 | 26-50 | 51-73

Table of contents of journal: *Journal of cryptology

Results: 26-50/73
BATCH DIFFIE-HELLMAN KEY AGREEMENT SYSTEMS
Authors: YACOBI Y BELLER MJ
Citation: Y. Yacobi et Mj. Beller, BATCH DIFFIE-HELLMAN KEY AGREEMENT SYSTEMS, Journal of cryptology, 10(2), 1997, pp. 89-96
LINKING INFORMATION RECONCILIATION AND PRIVACY AMPLIFICATION
Authors: CACHIN C MAURER UM
Citation: C. Cachin et Um. Maurer, LINKING INFORMATION RECONCILIATION AND PRIVACY AMPLIFICATION, Journal of cryptology, 10(2), 1997, pp. 97-110
FEEDBACK SHIFT REGISTERS, 2-ADIC SPAN, AND COMBINERS WITH MEMORY
Authors: KLAPPER A GORESKY M
Citation: A. Klapper et M. Goresky, FEEDBACK SHIFT REGISTERS, 2-ADIC SPAN, AND COMBINERS WITH MEMORY, Journal of cryptology, 10(2), 1997, pp. 111-147
ON SCHNORRS PREPROCESSING FOR DIGITAL SIGNATURE SCHEMES
Authors: DEROOIJ P
Citation: P. Derooij, ON SCHNORRS PREPROCESSING FOR DIGITAL SIGNATURE SCHEMES, Journal of cryptology, 10(1), 1997, pp. 1-16
LOCALLY RANDOM REDUCTIONS - IMPROVEMENTS AND APPLICATIONS
Authors: BEAVER D FEIGENBAUM J KILIAN J ROGAWAY P
Citation: D. Beaver et al., LOCALLY RANDOM REDUCTIONS - IMPROVEMENTS AND APPLICATIONS, Journal of cryptology, 10(1), 1997, pp. 17-36
A LANGUAGE-DEPENDENT CRYPTOGRAPHIC PRIMITIVE
Authors: ITOH T OHTA Y SHIZUYA H
Citation: T. Itoh et al., A LANGUAGE-DEPENDENT CRYPTOGRAPHIC PRIMITIVE, Journal of cryptology, 10(1), 1997, pp. 37-49
RIPEMD WITH 2-ROUND COMPRESS FUNCTION IS NOT COLLISION-FREE
Authors: DOBBERTIN H
Citation: H. Dobbertin, RIPEMD WITH 2-ROUND COMPRESS FUNCTION IS NOT COLLISION-FREE, Journal of cryptology, 10(1), 1997, pp. 51-69
A CHOSEN MESSAGE ATTACK ON DEMYTKOS ELLIPTIC CURVE CRYPTOSYSTEM
Authors: KALISKI BS
Citation: Bs. Kaliski, A CHOSEN MESSAGE ATTACK ON DEMYTKOS ELLIPTIC CURVE CRYPTOSYSTEM, Journal of cryptology, 10(1), 1997, pp. 71-72
EFFICIENT CRYPTOGRAPHIC SCHEMES PROVABLY AS SECURE AS SUBSET SUM
Authors: IMPAGLIAZZO R NAOR M
Citation: R. Impagliazzo et M. Naor, EFFICIENT CRYPTOGRAPHIC SCHEMES PROVABLY AS SECURE AS SUBSET SUM, Journal of cryptology, 9(4), 1996, pp. 199-216
JOINT ENCRYPTION AND MESSAGE-EFFICIENT SECURE COMPUTATION
Authors: FRANKLIN M HABER S
Citation: M. Franklin et S. Haber, JOINT ENCRYPTION AND MESSAGE-EFFICIENT SECURE COMPUTATION, Journal of cryptology, 9(4), 1996, pp. 217-232
IDEAL SECRET SHARING SCHEMES WITH MULTIPLE SECRETS
Authors: JACKSON WA MARTIN KM OKEEFE CM
Citation: Wa. Jackson et al., IDEAL SECRET SHARING SCHEMES WITH MULTIPLE SECRETS, Journal of cryptology, 9(4), 1996, pp. 233-250
PSEUDORANDOM GENERATORS AND THE FREQUENCY OF SIMPLICITY
Authors: HAN YJ HEMASPAANDRA LA
Citation: Yj. Han et La. Hemaspaandra, PSEUDORANDOM GENERATORS AND THE FREQUENCY OF SIMPLICITY, Journal of cryptology, 9(4), 1996, pp. 251-261
GUEST EDITORS INTRODUCTION
Authors: CREPEAU C
Citation: C. Crepeau, GUEST EDITORS INTRODUCTION, Journal of cryptology, 9(3), 1996, pp. 127-128
THE POWER OF PREPROCESSING IN ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE
Authors: DESANTIS A PERSIANO G
Citation: A. Desantis et G. Persiano, THE POWER OF PREPROCESSING IN ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE, Journal of cryptology, 9(3), 1996, pp. 129-148
CERTIFYING PERMUTATIONS - NONINTERACTIVE ZERO-KNOWLEDGE BASED ON ANY TRAPDOOR PERMUTATION
Authors: BELLARE M YUNG MT
Citation: M. Bellare et Mt. Yung, CERTIFYING PERMUTATIONS - NONINTERACTIVE ZERO-KNOWLEDGE BASED ON ANY TRAPDOOR PERMUTATION, Journal of cryptology, 9(3), 1996, pp. 149-166
HOW TO CONSTRUCT CONSTANT-ROUND ZERO-KNOWLEDGE PROOF SYSTEMS FOR NP
Authors: GOLDREICH O KAHAN A
Citation: O. Goldreich et A. Kahan, HOW TO CONSTRUCT CONSTANT-ROUND ZERO-KNOWLEDGE PROOF SYSTEMS FOR NP, Journal of cryptology, 9(3), 1996, pp. 167-189
A SECURE PROTOCOL FOR THE OBLIVIOUS TRANSFER (EXTENDED ABSTRACT)
Authors: FISCHER MJ MICALI S RACKOFF C
Citation: Mj. Fischer et al., A SECURE PROTOCOL FOR THE OBLIVIOUS TRANSFER (EXTENDED ABSTRACT), Journal of cryptology, 9(3), 1996, pp. 191-195
BOUNDS ON SECRET KEY EXCHANGE USING A RANDOM DEAL OF CARDS
Authors: FISCHER MJ WRIGHT RN
Citation: Mj. Fischer et Rn. Wright, BOUNDS ON SECRET KEY EXCHANGE USING A RANDOM DEAL OF CARDS, Journal of cryptology, 9(2), 1996, pp. 71-99
A LOW COMMUNICATION COMPETITIVE INTERACTIVE PROOF SYSTEM FOR PROMISEDQUADRATIC RESIDUOSITY
Authors: ITOH T HOSHI M TSUJII S
Citation: T. Itoh et al., A LOW COMMUNICATION COMPETITIVE INTERACTIVE PROOF SYSTEM FOR PROMISEDQUADRATIC RESIDUOSITY, Journal of cryptology, 9(2), 1996, pp. 101-109
CORRELATION-PROPERTIES OF A GENERAL BINARY COMBINER WITH MEMORY
Authors: GOLIC JD
Citation: Jd. Golic, CORRELATION-PROPERTIES OF A GENERAL BINARY COMBINER WITH MEMORY, Journal of cryptology, 9(2), 1996, pp. 111-126
SUBSTITUTION-PERMUTATION NETWORKS RESISTANT TO DIFFERENTIAL AND LINEAR CRYPTANALYSIS
Authors: HEYS HM TAVARES SE
Citation: Hm. Heys et Se. Tavares, SUBSTITUTION-PERMUTATION NETWORKS RESISTANT TO DIFFERENTIAL AND LINEAR CRYPTANALYSIS, Journal of cryptology, 9(1), 1996, pp. 1-19
DIFFERENTIAL CRYPTANALYSIS OF LUCIFER
Authors: BENAROYA I BIHAM E
Citation: I. Benaroya et E. Biham, DIFFERENTIAL CRYPTANALYSIS OF LUCIFER, Journal of cryptology, 9(1), 1996, pp. 21-34
ON-LINE OFF-LINE DIGITAL-SIGNATURES
Authors: EVEN S GOLDREICH O MICALI S
Citation: S. Even et al., ON-LINE OFF-LINE DIGITAL-SIGNATURES, Journal of cryptology, 9(1), 1996, pp. 35-67
INFORMATION-THEORETIC BOUNDS FOR AUTHENTICATION CODES AND BLOCK-DESIGNS
Authors: PEI DY
Citation: Dy. Pei, INFORMATION-THEORETIC BOUNDS FOR AUTHENTICATION CODES AND BLOCK-DESIGNS, Journal of cryptology, 8(4), 1995, pp. 177-188
ON KEY STORAGE IN SECURE NETWORKS
Authors: DYER M FENNER T FRIEZE A THOMASON A
Citation: M. Dyer et al., ON KEY STORAGE IN SECURE NETWORKS, Journal of cryptology, 8(4), 1995, pp. 189-200
Risultati: 1-25 | 26-50 | 51-73