Naor-Yung Paradigm with Shared Randomness and Applications

DOI10.1007/978-3-319-44618-9_4zbMath1400.94121OpenAlexW2512463526MaRDI QIDQ2827710

Daniel Masny, Silvio Biagioni, Daniele Venturi

Publication date: 21 October 2016

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

Full work available at URL: http://hdl.handle.net/11573/960008

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Naor-Yung paradigm with shared randomness and applications ⋮ Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments ⋮ Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating shorter bases for hard random lattices
• Key-dependent message security: generic amplification and completeness
• Probabilistic encryption
• Fully leakage-resilient signatures
• Efficient cryptographic schemes provably as secure as subset sum
• Non-Malleable Encryption: Simpler, Shorter, Stronger
• Chosen-Ciphertext Security from Subset Sum
• On the Hardness of Proving CCA-Security of Signed ElGamal
• On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions
• KDM-Security via Homomorphic Smooth Projective Hashing
• On the Non-malleability of the Fiat-Shamir Transform
• Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
• Adaptive Proofs of Knowledge in the Random Oracle Model
• Black-Box Circular-Secure Encryption beyond Affine Functions
• Efficient Public-Key Cryptography in the Presence of Key Leakage
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Relations Among Notions of Non-malleability for Encryption
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Leakage-Resilient Storage
• Circular-Secure Encryption from Decision Diffie-Hellman
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Signature Schemes with Bounded Leakage Resilience
• A public key cryptosystem and a signature scheme based on discrete logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Notion of Security for Probabilistic Cryptosystems
• New directions in cryptography
• A Pseudorandom Generator from any One-way Function
• Randomness Re-use in Multi-recipient Encryption Schemeas
• Circular Chosen-Ciphertext Security with Compact Ciphertexts
• Quantum Algorithms for the Subset-Sum Problem
• Survey: Leakage Resilience and the Bounded Retrieval Model
• A Second Look at Fischlin’s Transformation
• Outsourced Pattern Matching
• Leakage-Resilient Signatures with Graceful Degradation
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Public-Key Cryptosystems Resilient to Key Leakage
• Public-Key Cryptosystems Resilient to Key Leakage
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Naor-Yung Paradigm with Shared Randomness and Applications