Pages that link to "Item:Q5418685"

The following pages link to Advances in Cryptology – EUROCRYPT 2014 (Q5418685):

Displaying 38 items.

• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic (Q5418686) (← links)
• Polynomial Time Attack on Wild McEliece over Quadratic Extensions (Q5418687) (← links)
• Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus (Q5418688) (← links)
• Why Proving HIBE Systems Secure Is Difficult (Q5418689) (← links)
• Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack (Q5418690) (← links)
• Key Derivation without Entropy Waste (Q5418691) (← links)
• Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits (Q5418692) (← links)
• Revocable Quantum Timed-Release Encryption (Q5418693) (← links)
• Generic Universal Forgery Attack on Iterative Hash-Based MACs (Q5418694) (← links)
• Links between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities (Q5418695) (← links)
• Faster Compact Diffie–Hellman: Endomorphisms on the x-line (Q5418696) (← links)
• Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation (Q5418697) (← links)
• Protecting Obfuscation against Algebraic Attacks (Q5418698) (← links)
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices (Q5418699) (← links)
• Reconsidering Generic Composition (Q5418700) (← links)
• Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions (Q5418701) (← links)
• Honey Encryption: Security Beyond the Brute-Force Bound (Q5418702) (← links)
• Sometimes-Recurse Shuffle (Q5418703) (← links)
• Tight Security Bounds for Key-Alternating Ciphers (Q5418704) (← links)
• The Locality of Searchable Symmetric Encryption (Q5418705) (← links)
• A Bound for Multiparty Secret Key Agreement and Implications for a Problem of Secure Computing (Q5418706) (← links)
• Non-Interactive Secure Computation Based on Cut-and-Choose (Q5418707) (← links)
• Garbled RAM Revisited (Q5418708) (← links)
• Unifying Leakage Models: From Probing Attacks to Noisy Leakage. (Q5418709) (← links)
• Higher Order Masking of Look-Up Tables (Q5418710) (← links)
• How to Certify the Leakage of a Chip? (Q5418711) (← links)
• Efficient Round Optimal Blind Signatures (Q5418712) (← links)
• Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig (Q5418713) (← links)
• Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures (Q5418714) (← links)
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits (Q5418715) (← links)
• Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More (Q5418716) (← links)
• Multi-input Functional Encryption (Q5418717) (← links)
• Salvaging Indifferentiability in a Multi-stage Setting (Q5418718) (← links)
• Déjà Q: Using Dual Systems to Revisit q-Type Assumptions (Q5418719) (← links)
• Distributed Point Functions and Their Applications (Q5418720) (← links)
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation (Q5418721) (← links)
• On the Complexity of UC Commitments (Q5418722) (← links)
• Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption (Q5418723) (← links)