Pages that link to "Item:Q2874492"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2014 (Q2874492):
Displaying 50 items.
- Security of Symmetric Encryption against Mass Surveillance (Q2874493) (← links)
- The Security of Multiple Encryption in the Ideal Cipher Model (Q2874494) (← links)
- Minimizing the Two-Round Even-Mansour Cipher (Q2874495) (← links)
- Block Ciphers – Focus on the Linear Layer (feat. PRIDE) (Q2874496) (← links)
- Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier (Q2874497) (← links)
- Automated Analysis of Cryptographic Assumptions in Generic Group Models (Q2874498) (← links)
- The Exact PRF-Security of NMAC and HMAC (Q2874500) (← links)
- Updates on Generic Attacks against HMAC and NMAC (Q2874501) (← links)
- Improved Generic Attacks against Hash-Based MACs and HAIFA (Q2874502) (← links)
- Cryptography from Compression Functions: The UCE Bridge to the ROM (Q2874503) (← links)
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources (Q2874504) (← links)
- Low Overhead Broadcast Encryption from Multilinear Maps (Q2874505) (← links)
- Security Analysis of Multilinear Maps over the Integers (Q2874506) (← links)
- Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups (Q2874508) (← links)
- Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations (Q2874509) (← links)
- Revisiting the Gentry-Szydlo Algorithm (Q2874510) (← links)
- Faster Bootstrapping with Polynomial Error (Q2874511) (← links)
- Hardness of k-LWE and Applications in Traitor Tracing (Q2874512) (← links)
- Improved Short Lattice Signatures in the Standard Model (Q2874513) (← links)
- New and Improved Key-Homomorphic Pseudorandom Functions (Q2874514) (← links)
- Homomorphic Signatures with Efficient Verification for Polynomial Functions (Q2874515) (← links)
- Structure-Preserving Signatures from Type II Pairings (Q2874516) (← links)
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication (Q2874517) (← links)
- Witness Encryption from Instance Independent Assumptions (Q2874518) (← links)
- RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis (Q2874519) (← links)
- On the Impossibility of Cryptography with Tamperable Randomness (Q2874520) (← links)
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation (Q2874521) (← links)
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings (Q2874522) (← links)
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input (Q2874523) (← links)
- Maliciously Circuit-Private FHE (Q2874525) (← links)
- Algorithms in HElib (Q2874526) (← links)
- Quantum Position Verification in the Random Oracle Model (Q2874527) (← links)
- Single-Shot Security for One-Time Memories in the Isolated Qubits Model (Q2874528) (← links)
- How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGs (Q2874529) (← links)
- Cryptography with Streaming Algorithms (Q2874530) (← links)
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator (Q2874531) (← links)
- Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications (Q2874532) (← links)
- On Virtual Grey Box Obfuscation for General Circuits (Q2874533) (← links)
- Breaking ‘128-bit Secure’ Supersingular Binary Curves (Q2874534) (← links)
- Leakage-Tolerant Computation with Input-Independent Preprocessing (Q2874535) (← links)
- Interactive Proofs under Continual Memory Leakage (Q2874536) (← links)
- Amplifying Privacy in Privacy Amplification (Q2874537) (← links)
- On the Communication Complexity of Secure Computation (Q2874538) (← links)
- Optimal Non-perfect Uniform Secret Sharing Schemes (Q2874539) (← links)
- Proving the TLS Handshake Secure (As It Is) (Q2874540) (← links)
- Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment (Q2874541) (← links)
- Scalable Zero Knowledge via Cycles of Elliptic Curves (Q2874542) (← links)
- Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces (Q2874543) (← links)
- Physical Zero-Knowledge Proofs of Physical Properties (Q2874544) (← links)
- Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity (Q2874545) (← links)
