The following pages link to Journal of Cryptology (Q166358):
Displaying 32 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- New second-preimage attacks on hash functions (Q321303) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Mutual information analysis: a comprehensive study (Q656515) (← links)
- On the fly authentication and signature schemes based on groups of unknown order (Q862419) (← links)
- Trapdoor hard-to-invert group isomorphisms and their application to password-based authentication (Q882777) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- The cryptanalysis of FEAL-4 with 20 chosen plaintexts (Q918498) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Instant ciphertext-only cryptanalysis of GSM encrypted communication (Q1021231) (← links)
- The twin Diffie-Hellman problem and applications (Q1037234) (← links)
- Is the data encryption standard a group? (Results of cycling experiments on DES) (Q1112006) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Parallel collision search with cryptanalytic applications (Q1284011) (← links)
- The discrete logarithm problem on elliptic curves of trace one (Q1304977) (← links)
- New types of cryptanalytic attacks using related keys (Q1340196) (← links)
- An improvement of Davies' attack on DES (Q1364902) (← links)
- Security arguments for digital signatures and blind signatures (Q1573771) (← links)
- Short non-interactive cryptographic proofs (Q1590362) (← links)
- Unifying leakage models: from probing attacks to noisy leakage (Q1715856) (← links)
- Provable security against a differential attack (Q1842516) (← links)
- The insecurity of the digital signature algorithm with partially known nonces (Q1849602) (← links)
- Optimal randomizer efficiency in the bounded-storage model (Q1879466) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? (Q2018816) (← links)
- Quantum private information retrieval has linear communication complexity (Q2018821) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- Structural attacks for public key cryptosystems based on Gabidulin codes (Q2425529) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
