The following pages link to Journal of Cryptology (Q166358):
Displaying 50 items.
- Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol (Q802867) (← links)
- Differential cryptanalysis of DES-like cryptosystems (Q807011) (← links)
- Bit commitment using pseudorandomness (Q808241) (← links)
- Efficient, perfect polynomial random number generators (Q809536) (← links)
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority (Q809588) (← links)
- Efficient quantum key distribution scheme and a proof of its unconditional security (Q814839) (← links)
- CBC MACs for arbitrary-length messages: The three-key constructions (Q814842) (← links)
- Low bandwidth dynamic traitor tracing schemes (Q814843) (← links)
- An improved pseudo-random generator based on the discrete logarithm problem (Q814844) (← links)
- Building curves with arbitrary small MOV degree over finite prime fields (Q814847) (← links)
- Private computation: \(k\)-connected versus 1-connected networks (Q850501) (← links)
- A simpler construction of CCA2-secure public-key encryption under general assumptions (Q850502) (← links)
- Session-key generation using human passwords only (Q850503) (← links)
- A proof of the security of quantum key distribution (Q862412) (← links)
- Known-IV, known-in-Advance-IV, and replayed-and-Known-IV attacks on multiple modes of operation of block ciphers (Q862415) (← links)
- On the fly authentication and signature schemes based on groups of unknown order (Q862419) (← links)
- An extended quadratic Frobenius primality test with average- and worst-case error estimate (Q862420) (← links)
- Completeness in two-party secure computation: A computational view (Q862422) (← links)
- Elliptic curves with low embedding degree (Q862423) (← links)
- The security of the IAPM and IACBC modes (Q877808) (← links)
- Hierarchical threshold secret sharing (Q877809) (← links)
- Constant-round oblivious transfer in the bounded storage model (Q877811) (← links)
- Formal proofs for the security of signcryption (Q877813) (← links)
- Another look at ``provable security'' (Q882771) (← links)
- Secure distributed key generation for discrete-log based cryptosystems (Q882774) (← links)
- Scalable protocols for authenticated group key exchange (Q882775) (← links)
- Trapdoor hard-to-invert group isomorphisms and their application to password-based authentication (Q882777) (← links)
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (Q882779) (← links)
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- On weak keys and forgery attacks against polynomial-based MAC schemes (Q901368) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- New proofs for NMAC and HMAC: security without collision resistance (Q901373) (← links)
- Collision attack on \({\mathtt Grindahl}\) (Q901374) (← links)
- Secure circuit evaluation. A protocol based on hiding information from an oracle (Q913487) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- Probability to meet in the middle (Q914644) (← links)
- The combinatorics of authentication and secrecy codes (Q914645) (← links)
- A matrix key-distribution scheme (Q914646) (← links)
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration (Q914647) (← links)
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences (Q914648) (← links)
- A fast software one-way hash function (Q918189) (← links)
- Information-theoretic bounds for authentication schemes (Q918497) (← links)
- The cryptanalysis of FEAL-4 with 20 chosen plaintexts (Q918498) (← links)
- Enumerating Boolean functions of cryptographic significance (Q918500) (← links)
- Methods and instruments for designing S-boxes (Q918502) (← links)
- Key-minimal cryptosystems for unconditional secrecy (Q923053) (← links)
- The structured design of cryptographically good s-boxes (Q923056) (← links)
- Constructive and destructive use of compilers in elliptic curve cryptography (Q1015356) (← links)
- Multipartite secret sharing by bivariate interpolation (Q1015357) (← links)
