The following pages link to Journal of Cryptology (Q166358):
Displaying 50 items.
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- A proof of security of Yao's protocol for two-party computation (Q1015361) (← links)
- Instant ciphertext-only cryptanalysis of GSM encrypted communication (Q1021231) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions (Q1021236) (← links)
- Cryptanalysis of the Shpilrain-Ushakov protocol for Thompson's group (Q1021237) (← links)
- Cryptanalysis of an E0-like combiner with memory (Q1021238) (← links)
- Index calculus in class groups of non-hyperelliptic curves of genus three (Q1021239) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- Encryption modes with almost free message integrity (Q1021243) (← links)
- New binding-concealing trade-offs for quantum string commitment (Q1021244) (← links)
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm (Q1021246) (← links)
- Cryptographic hash functions from expander graphs (Q1027970) (← links)
- Ring signatures: Stronger definitions, and constructions without random oracles (Q1027973) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← links)
- Chernoff-type direct product theorems (Q1027975) (← links)
- A public key cryptosystem based on non-abelian finite groups (Q1027976) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Upper and lower bounds on black-box steganography (Q1027982) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
- On the impossibility of highly-efficient blockcipher-based hash functions (Q1027986) (← links)
- Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves (Q1037232) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- The twin Diffie-Hellman problem and applications (Q1037234) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Some constructions and bounds for authentication codes (Q1109006) (← links)
- The dining cryptographers problem: Unconditional sender and recipient untraceability (Q1109008) (← links)
- Is the data encryption standard a group? (Results of cycling experiments on DES) (Q1112006) (← links)
- A construction for authentication/secrecy codes from certain combinatorial designs (Q1112007) (← links)
- A key distribution system equivalent to factoring (Q1112781) (← links)
- A key-exchange system based on imaginary quadratic fields (Q1112782) (← links)
- A generalization of Hellman's extension of Shannon's approach to cryptography (Q1112784) (← links)
- Zero-knowledge proofs of identity (Q1112785) (← links)
- How to share a secret with cheaters (Q1112786) (← links)
- The generation of random numbers that are probably prime (Q1118632) (← links)
- Inferring sequences produced by a linear congruential generator missing low-order bits (Q1121239) (← links)
- Fast correlation attacks on certain stream ciphers (Q1121241) (← links)
- Linear ciphers and spreads (Q1121242) (← links)
- A study of password security (Q1121243) (← links)
- Hyperelliptic cryptosystems (Q1121852) (← links)
- On matroid characterization of ideal secret sharing schemes (Q1126889) (← links)
- Perfect zero-knowledge arguments for NP using any one-way permutation (Q1126890) (← links)
- A public-key cryptosystem using purely cubic fields (Q1126891) (← links)
- The black-box model for cryptographic primitives (Q1126893) (← links)
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm (Q1126894) (← links)
- New bounds and constructions for authentication/secrecy codes with splitting (Q1176594) (← links)
- Efficient signature generation by smart cards (Q1180508) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
