The following pages link to Journal of Cryptology (Q166358):
Displaying 50 items.
- Short undeniable signatures based on group homomorphisms (Q451120) (← links)
- Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time (Q451122) (← links)
- Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- Authenticated adversarial routing (Q484328) (← links)
- Improved cryptanalysis of AES-like permutations (Q484330) (← links)
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- A practical-time related-key attack on the \texttt{KASUMI} cryptosystem used in GSM and 3G telephony (Q484333) (← links)
- Weak locking capacity of quantum channels can be much larger than private capacity (Q514464) (← links)
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- An algebraic framework for Diffie-Hellman assumptions (Q514473) (← links)
- Obfuscating conjunctions (Q514475) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Structural cryptanalysis of SASAS (Q604629) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- Long-term security and universal composability (Q604632) (← links)
- An analysis of the blockcipher-based hash functions from PGV (Q604636) (← links)
- Glitch and laser fault attacks onto a secure AES implementation on a SRAM-based FPGA (Q656510) (← links)
- Mutual information analysis: a comprehensive study (Q656515) (← links)
- Secure hardware implementation of nonlinear functions in the presence of glitches (Q656517) (← links)
- Side-channel resistant crypto for less than 2,300 GE (Q656520) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- Improved ring oscillator PUF: an FPGA-friendly secure primitive (Q656526) (← links)
- On the security of oscillator-based random number generators (Q656530) (← links)
- Securely obfuscating re-encryption (Q656916) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Secure computation without authentication (Q656923) (← links)
- Efficient selective identity-based encryption without random oracles (Q656924) (← links)
- On Schnorr's preprocessing for digital signature schemes (Q676822) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- RIPEMD with two-round compress function is not collision-free (Q676830) (← links)
- A chosen message attack on Demytko's elliptic curve cryptosystem (Q676832) (← links)
- Robust multi-property combiners for hash functions (Q744343) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- Rotational rebound attacks on reduced Skein (Q744348) (← links)
- On best-possible obfuscation (Q744349) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Improved practical attacks on round-reduced Keccak (Q744599) (← links)
- Better security for deterministic public-key encryption: the auxiliary-input setting (Q744600) (← links)
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication (Q744601) (← links)
- On the amortized complexity of zero-knowledge protocols (Q744603) (← links)
- On strong simulation and composable point obfuscation (Q744605) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
