Naor-Yung paradigm with shared randomness and applications
From MaRDI portal
Publication:2401764
DOI10.1016/j.tcs.2017.06.019zbMath1421.94040OpenAlexW2733333345MaRDI QIDQ2401764
Daniele Venturi, Silvio Biagioni, Daniel Masny
Publication date: 5 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.06.019
Uses Software
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
- (Leveled) fully homomorphic encryption without bootstrapping
- Naor-Yung Paradigm with Shared Randomness and Applications
- Bounded KDM Security from iO and OWF
- Lattice Signatures and Bimodal Gaussians
- Identity-Based Encryption with Master Key-Dependent Message Security and Leakage-Resilience
- On the Non-malleability of the Fiat-Shamir Transform
- Quantum Proofs of Knowledge
- Multiparty Computation from Somewhat Homomorphic Encryption
- 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
- Key-Dependent Message Security: Generic Amplification and Completeness
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- The random oracle methodology, revisited
- 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
- Zero Knowledge in the Random Oracle Model, Revisited
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- 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
- A new identification scheme based on syndrome decoding
- 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
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- 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