The following pages link to Cryptography and Coding (Q2870080):
Displaying 50 items.
- Semi-bent Functions from Oval Polynomials (Q2870081) (← links)
- Efficient Generation of Elementary Sequences (Q2870082) (← links)
- On the Homomorphic Computation of Symmetric Cryptographic Primitives (Q2870083) (← links)
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme (Q2870084) (← links)
- On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption (Q2870085) (← links)
- On Minimal and Quasi-minimal Linear Codes (Q2870086) (← links)
- A Code-Based Undeniable Signature Scheme (Q2870088) (← links)
- Filtered Nonlinear Cryptanalysis of Reduced-Round Serpent, and the Wrong-Key Randomization Hypothesis (Q2870089) (← links)
- Differential Cryptanalysis of Keccak Variants (Q2870091) (← links)
- Recovering Private Keys Generated with Weak PRNGs (Q2870092) (← links)
- A Leakage-Resilient Pairing-Based Variant of the Schnorr Signature Scheme (Q2870093) (← links)
- High-order Masking by Using Coding Theory and Its Application to AES (Q2870095) (← links)
- Hashing Mode Using a Lightweight Blockcipher (Q2870096) (← links)
- Indifferentiability of Double Length Compression Functions (Q2870097) (← links)
- Security Amplification against Meet-in-the-Middle Attacks Using Whitening (Q2870098) (← links)
- Secure Key Management in the Cloud (Q2870099) (← links)
- Estimating Key Sizes for High Dimensional Lattice-Based Systems (Q2870100) (← links)
- Sub-linear Blind Ring Signatures without Random Oracles (Q2870101) (← links)
- Constructions of Signcryption in the Multi-user Setting from Identity-Based Encryption (Q2870103) (← links)
- Anonymous Constant-Size Ciphertext HIBE from Asymmetric Pairings (Q2870104) (← links)
- Can a Program Reverse-Engineer Itself? (Q3104681) (← links)
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme (Q3104682) (← links)
- On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683) (← links)
- Generalised Complementary Arrays (Q3104684) (← links)
- Binary Kloosterman Sums with Value 4 (Q3104685) (← links)
- On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1} (Q3104686) (← links)
- A Secure and Efficient Proof of Integer in an Interval Range (Q3104687) (← links)
- Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction (Q3104689) (← links)
- Self-correctors for Cryptographic Modules (Q3104690) (← links)
- The Symbiosis between Collision and Preimage Resistance (Q3104691) (← links)
- Enhanced Count of Balanced Symmetric Functions and Balanced Alternating Functions (Q3104693) (← links)
- Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting (Q3104695) (← links)
- Constructing Secure Hybrid Encryption from Key Encapsulation Mechanism with Authenticity (Q3104697) (← links)
- A Note on the Dual Codes of Module Skew Codes (Q3104698) (← links)
- Ensuring Message Embedding in Wet Paper Steganography (Q3104699) (← links)
- On the Stability of m-Sequences (Q3104700) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves (Q3104704) (← links)
- Breaking an Identity-Based Encryption Scheme Based on DHIES (Q3104705) (← links)
- Analysis of the SSH Key Exchange Protocol (Q3104707) (← links)
- Cryptanalysis of the Light-Weight Cipher A2U2 (Q3104709) (← links)
- Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal (Q3104710) (← links)
- Security of Hash-then-CBC Key Wrapping Revisited (Q3104712) (← links)
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
- On Forward Secrecy in One-Round Key Exchange (Q3104714) (← links)
- Designated Confirmer Signatures with Unified Verification (Q3104715) (← links)
- On Existence (Based on an Arithmetical Problem) and Constructions of Bent Functions (Q3460095) (← links)
- Security Against Related Randomness Attacks via Reconstructive Extractors (Q3460096) (← links)
