Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/b97182zbMath1122.94368OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307273

No author found.

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97182

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17) Theory of error-correcting codes and error-detecting codes (94B99) Randomized algorithms (68W20) Decoding (94B35) Authentication, digital signatures and secret sharing (94A62)

Related Items (68)

SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Robustly reusable fuzzy extractor with imperfect randomness ⋮ Two-message statistically sender-private OT from LWE ⋮ LWE without modular reduction and improved side-channel attacks against BLISS ⋮ The generic construction of continuous leakage-resilient identity-based cryptosystems ⋮ Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs ⋮ Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions ⋮ Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ Analysis and protection of the two-metric helper data scheme ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Precision Statistics: Fractional Number of Degrees of Freedom Chi-Square Criterion for Small Samples of Biometric Data ⋮ A generic construction of fuzzy signature ⋮ Robust extended chaotic maps-based three-factor authentication scheme preserving biometric template privacy ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Incompressible cryptography ⋮ Obfuscated fuzzy Hamming distance and conjunctions from subset product problems ⋮ The Chain Rule for HILL Pseudoentropy, Revisited ⋮ Security Analysis of PRINCE ⋮ Information Theoretic Security for Encryption Based on Conditional Rényi Entropies ⋮ On the leakage-resilient key exchange ⋮ Detecting Algebraic Manipulation in Leaky Storage Systems ⋮ Public-key encryption scheme with optimal continuous leakage resilience ⋮ Simple Codes and Sparse Recovery with Fast Decoding ⋮ SETLA: Signature and Encryption from Lattices ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits ⋮ Unnamed Item ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model ⋮ Provably secure certificate-based encryption with leakage resilience ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Circular security is complete for KDM security ⋮ Fuzzy asymmetric password-authenticated key exchange ⋮ Password Mistyping in Two-Factor-Authenticated Key Exchange ⋮ Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Robustly reusable fuzzy extractor from standard assumptions ⋮ Bounded-Retrieval Model with Keys Derived from Private Data ⋮ Leakage-Resilient IND-CCA KEM from the Extractable Hash Proofs with Indistinguishability Obfuscation ⋮ Secure and Private, yet Lightweight, Authentication for the IoT via PUF and CBKA ⋮ Lossy Key Encapsulation Mechanism and Its Applications ⋮ A PUF and Software Collaborative Key Protection Scheme ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ О безопасности схемы биометрической аутентификации, основанной на нейронной сети ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ A generic construction of CCA-secure deterministic encryption ⋮ Hiding Secret Points Amidst Chaff ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ A Signature Scheme with a Fuzzy Private Key ⋮ mrPUF: A Novel Memristive Device Based Physical Unclonable Function ⋮ Novel updatable identity-based hash proof system and its applications ⋮ Reusable fuzzy extractor from the decisional Diffie-Hellman assumption ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Identity-based encryption with leakage-amplified chosen-ciphertext attacks security ⋮ Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks ⋮ Data recovery for a neural network-based biometric authentication scheme ⋮ Leakage-resilient biometric-based remote user authentication with fuzzy extractors ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Quantitative Information Flow and Applications to Differential Privacy ⋮ On selective-opening security of deterministic primitives ⋮ BETA: biometric-enabled threshold authentication ⋮ FHE Circuit Privacy Almost for Free ⋮ Wildcarded identity-based encryption from lattices ⋮ Efficient Threshold Encryption from Lossy Trapdoor Functions ⋮ A novel fuzzy vault scheme based on fingerprint and finger vein feature fusion ⋮ Continuous leakage-resilient identity-based encryption with leakage amplification ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004