Pages that link to "Item:Q2820475"
From MaRDI portal
The following pages link to Advances in Cryptology – EUROCRYPT 2016 (Q2820475):
Displaying 50 items.
- Tightly CCA-Secure Encryption Without Pairings (Q2820476) (← links)
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes (Q2820477) (← links)
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions (Q2820478) (← links)
- Provably Robust Sponge-Based PRNGs and KDFs (Q2820479) (← links)
- Reusable Fuzzy Extractors for Low-Entropy Distributions (Q2820480) (← links)
- Provably Weak Instances of Ring-LWE Revisited (Q2820481) (← links)
- Faster Algorithms for Solving LPN (Q2820482) (← links)
- Provable Security Evaluation of Structures Against Impossible Differential and Zero Correlation Linear Cryptanalysis (Q2820483) (← links)
- Polytopic Cryptanalysis (Q2820484) (← links)
- From Improved Leakage Detection to the Detection of Points of Interests in Leakage Traces (Q2820485) (← links)
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption (Q2820486) (← links)
- Sanitization of FHE Ciphertexts (Q2820487) (← links)
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts (Q2820488) (← links)
- Improved Differential-Linear Cryptanalysis of 7-Round Chaskey with Partitioning (Q2820489) (← links)
- Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1 (Q2820490) (← links)
- Complete Addition Formulas for Prime Order Elliptic Curves (Q2820491) (← links)
- New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields (Q2820492) (← links)
- Freestart Collision for Full SHA-1 (Q2820493) (← links)
- New Attacks on the Concatenation and XOR Hash Combiners (Q2820494) (← links)
- Cryptanalysis of the New CLT Multilinear Map over the Integers (Q2820495) (← links)
- Cryptanalysis of GGH Map (Q2820496) (← links)
- Hash-Function Based PRFs: AMAC and Its Multi-User Security (Q2820497) (← links)
- On the Influence of Message Length in PMAC’s Security Bounds (Q2820498) (← links)
- Lucky Microseconds: A Timing Attack on Amazon’s s2n Implementation of TLS (Q2820499) (← links)
- An Analysis of OpenSSL’s Random Number Generator (Q2820501) (← links)
- Safely Exporting Keys from Secure Channels (Q2820503) (← links)
- Valiant’s Universal Circuit is Practical (Q2820504) (← links)
- Nonce-Based Cryptography: Retaining Security When Randomness Fails (Q2820505) (← links)
- Honey Encryption Beyond Message Recovery Security (Q2820506) (← links)
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator (Q2820508) (← links)
- Practical, Predictable Lattice Basis Reduction (Q2820509) (← links)
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors (Q5739196) (← links)
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters (Q5739197) (← links)
- Online/Offline OR Composition of Sigma Protocols (Q5739198) (← links)
- Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance (Q5739199) (← links)
- Constrained Pseudorandom Functions for Unconstrained Inputs (Q5739200) (← links)
- Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN (Q5739201) (← links)
- Secure Computation from Elastic Noisy Channels (Q5739202) (← links)
- All Complete Functionalities are Reversible (Q5739203) (← links)
- On the Power of Hierarchical Identity-Based Encryption (Q5739204) (← links)
- On the Impossibility of Tight Cryptographic Reductions (Q5739205) (← links)
- On the Size of Pairing-Based Non-interactive Arguments (Q5739206) (← links)
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (Q5739207) (← links)
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model (Q5739208) (← links)
- Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key (Q5739209) (← links)
- Unconditionally Secure Computation with Reduced Interaction (Q5739210) (← links)
- The Exact Round Complexity of Secure Computation (Q5739211) (← links)
- On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments (Q5739212) (← links)
- Computationally Binding Quantum Commitments (Q5739213) (← links)
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems (Q5739214) (← links)
