Pages that link to "Item:Q1949833"
From MaRDI portal
The following pages link to Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings (Q1949833):
Displaying 50 items.
- Masking and leakage-resilient primitives: one, the other(s) or both? (Q892292) (← links)
- Advances in cryptology -- EUROCRYPT 2003. International conference on the theory and applications of cryptographic techniques, Warsaw, Poland, May 4--8, 2003. Proceedings (Q1407728) (← links)
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version (Q2010587) (← links)
- CArrency: an energy-efficient proof-of-work scheme for crypto-currencies (Q2079889) (← links)
- Practical Free-Start Collision Attacks on 76-step SHA-1 (Q3457131) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- (Q4924399) (redirect page) (← links)
- Candidate Multilinear Maps from Ideal Lattices (Q4924400) (← links)
- Lossy Codes and a New Variant of the Learning-With-Errors Problem (Q4924401) (← links)
- A Toolkit for Ring-LWE Cryptography (Q4924402) (← links)
- Regularity of Lossy RSA on Subdomains and Its Applications (Q4924403) (← links)
- Efficient Cryptosystems from 2 k -th Power Residue Symbols (Q4924404) (← links)
- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions (Q4924405) (← links)
- How to Watermark Cryptographic Functions (Q4924406) (← links)
- Security Evaluations beyond Computing Power (Q4924407) (← links)
- Masking against Side-Channel Attacks: A Formal Security Proof (Q4924408) (← links)
- Leakage-Resilient Cryptography from Minimal Assumptions (Q4924409) (← links)
- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields (Q4924410) (← links)
- Fast Cryptography in Genus 2 (Q4924411) (← links)
- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem (Q4924412) (← links)
- Cryptanalysis of Full RIPEMD-128 (Q4924413) (← links)
- New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis (Q4924414) (← links)
- Improving Local Collisions: New Attacks on Reduced SHA-256 (Q4924415) (← links)
- Dynamic Proofs of Retrievability via Oblivious RAM (Q4924416) (← links)
- Message-Locked Encryption and Secure Deduplication (Q4924417) (← links)
- Keccak (Q4924418) (← links)
- Batch Fully Homomorphic Encryption over the Integers (Q4924419) (← links)
- Practical Homomorphic MACs for Arithmetic Circuits (Q4924420) (← links)
- Streaming Authenticated Data Structures (Q4924421) (← links)
- Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting (Q4924422) (← links)
- New Links between Differential and Linear Cryptanalysis (Q4924423) (← links)
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption (Q4924424) (← links)
- Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions (Q4924425) (← links)
- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures (Q4924426) (← links)
- Practical Signatures from Standard Assumptions (Q4924427) (← links)
- Locally Computable UOWHF with Linear Shrinkage (Q4924428) (← links)
- Amplification of Chosen-Ciphertext Security (Q4924429) (← links)
- Circular Chosen-Ciphertext Security with Compact Ciphertexts (Q4924430) (← links)
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions (Q4924431) (← links)
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation (Q4924432) (← links)
- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction (Q4924433) (← links)
- Quantum-Secure Message Authentication Codes (Q4924434) (← links)
- One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games (Q4924435) (← links)
- Quadratic Span Programs and Succinct NIZKs without PCPs (Q4924436) (← links)
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists (Q4924437) (← links)
- Resource-Restricted Indifferentiability (Q4924438) (← links)
- On Concurrently Secure Computation in the Multiple Ideal Query Model (Q4924439) (← links)
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions (Q4924440) (← links)
- How to Garble RAM Programs? (Q4924441) (← links)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
