Naor-Yung Paradigm with Shared Randomness and Applications

DOI10.1007/978-3-319-44618-9_4MaRDI QIDQ2827710zbMATH OpenOpenAlexFDO

Authors Silvio Biagioni, Daniel Masny, D. 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

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

Recommendations

• Naor-Yung paradigm with shared randomness and applications
• Common randomness in information theory and cryptography. I. Secret sharing
• The Power of Shared Randomness in Uncertain Communication
• A note on Yao's theorem about pseudo-random generators
• Random oracles and non-uniformity
• On the structure of parallelized random number sources
• scientific article; zbMATH DE number 7765409
• Theory of Cryptography
• On the role of shared randomness in simultaneous communication

Cites work

• A Pseudorandom Generator from any One-way Function
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• A second look at Fischlin's transformation
• Adaptive proofs of knowledge in the random oracle model
• Black-box circular-secure encryption beyond affine functions
• Chosen-ciphertext security from subset sum
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular chosen-ciphertext security with compact ciphertexts
• Circular-Secure Encryption from Decision Diffie-Hellman
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Efficient cryptographic schemes provably as secure as subset sum
• Efficient public-key cryptography in the presence of key leakage
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Fully leakage-resilient signatures
• Generating shorter bases for hard random lattices
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• scientific article; zbMATH DE number 1302834 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1302836 (Why is no real title available?)
• scientific article; zbMATH DE number 1341866 (Why is no real title available?)
• scientific article; zbMATH DE number 1951605 (Why is no real title available?)
• scientific article; zbMATH DE number 1857508 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• KDM-security via homomorphic smooth projective hashing
• Key-dependent message security: generic amplification and completeness
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• Leakage-Resilient Signatures with Graceful Degradation
• Leakage-resilient storage
• Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
• Mind your coins: fully leakage-resilient signatures with graceful degradation
• New directions in cryptography
• Non-malleable encryption: simpler, shorter, stronger
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• On the hardness of proving CCA-security of Signed ElGamal
• On the key dependent message security of the Fujisaki-Okamoto constructions
• On the Non-malleability of the Fiat-Shamir Transform
• Outsourced pattern matching
• Probabilistic encryption
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Public-key cryptosystems resilient to key leakage
• Public-Key Cryptosystems Resilient to Key Leakage
• Quantum algorithms for the subset-sum problem
• Randomness Re-use in Multi-recipient Encryption Schemeas
• Relations Among Notions of Non-malleability for Encryption
• Signature schemes with bounded leakage resilience
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Survey: leakage resilience and the bounded retrieval model
• The Notion of Security for Probabilistic Cryptosystems
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems

Cited in

(5)

• Naor-Yung paradigm with shared randomness and applications
• Simulation-sound arguments for LWE and applications to KDM-CCA2 security
• 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)
• Efficient verifiable mixnets from lattices, revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827710)