Pages that link to "Item:Q2845656"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2013 (Q2845656):
Displaying 50 items.
- Practical Bootstrapping in Quasilinear Time (Q2845657) (← links)
- Hardness of SIS and LWE with Small Parameters (Q2845658) (← links)
- Lattice Signatures and Bimodal Gaussians (Q2845659) (← links)
- Learning with Rounding, Revisited (Q2845660) (← links)
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based (Q2845661) (← links)
- A Uniform Min-Max Theorem with Applications in Cryptography (Q2845663) (← links)
- Limits of Provable Security for Homomorphic Encryption (Q2845664) (← links)
- Counter-Cryptanalysis (Q2845665) (← links)
- Fuming Acid and Cryptanalysis: Handy Tools for Overcoming a Digital Locking and Access Control System (Q2845670) (← links)
- Real Time Cryptanalysis of Bluetooth Encryption with Condition Masking (Q2845671) (← links)
- Structural Evaluation of AES and Chosen-Key Distinguisher of 9-Round AES-128 (Q2845672) (← links)
- Bounds in Shallows and in Miseries (Q2845673) (← links)
- Sieve-in-the-Middle: Improved MITM Attacks (Q2845675) (← links)
- Construction of Differential Characteristics in ARX Designs Application to Skein (Q2845676) (← links)
- On Fair Exchange, Fair Coins and Fair Sampling (Q2845677) (← links)
- Limits on the Power of Cryptographic Cheap Talk (Q2845678) (← links)
- Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols (Q2845679) (← links)
- Secure Computation against Adaptive Auxiliary Information (Q2845680) (← links)
- Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions (Q2845681) (← links)
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries (Q2845683) (← links)
- Message-Locked Encryption for Lock-Dependent Messages (Q2845684) (← links)
- The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries (Q2845685) (← links)
- Key Homomorphic PRFs and Their Applications (Q2845686) (← links)
- On the Security of the TLS Protocol: A Systematic Analysis (Q2845687) (← links)
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols (Q2845688) (← links)
- Practical Multilinear Maps over the Integers (Q2845689) (← links)
- Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures (Q2845690) (← links)
- Programmable Hash Functions in the Multilinear Setting (Q2845692) (← links)
- On the Indifferentiability of Key-Alternating Ciphers (Q2845693) (← links)
- Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers (Q2845694) (← links)
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions (Q2845695) (← links)
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries (Q2849382) (← links)
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose (Q2849384) (← links)
- Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation (Q2849385) (← links)
- Improved OT Extension for Transferring Short Secrets (Q2849386) (← links)
- Time-Optimal Interactive Proofs for Circuit Evaluation (Q2849387) (← links)
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge (Q2849388) (← links)
- On the Function Field Sieve and the Impact of Higher Splitting Probabilities (Q2849389) (← links)
- An Algebraic Framework for Diffie-Hellman Assumptions (Q2849390) (← links)
- Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields (Q2849392) (← links)
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys (Q2849393) (← links)
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae (Q2849395) (← links)
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation (Q2849397) (← links)
- What Information Is Leaked under Concurrent Composition? (Q2849398) (← links)
- Non-malleable Codes from Two-Source Extractors (Q2849399) (← links)
- Secret Sharing, Rank Inequalities and Information Inequalities (Q2849401) (← links)
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications (Q2849402) (← links)
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs (Q2849403) (← links)
- Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling (Q2849404) (← links)
- Quantum One-Time Programs (Q2849405) (← links)
