Pages that link to "Item:Q3563848"

The following pages link to Bounded Key-Dependent Message Security (Q3563848):

Displaying 33 items.

• Key-dependent message security: generic amplification and completeness (Q744344) (← links)
• Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model (Q893865) (← links)
• Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
• Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
• Reproducible circularly secure bit encryption: applications and realizations (Q1698399) (← links)
• Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
• Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks (Q2061928) (← links)
• CPA-to-CCA transformation for KDM security (Q2175934) (← links)
• KDM security for identity-based encryption: constructions and separations (Q2215124) (← links)
• On the power of secure two-party computation (Q2303458) (← links)
• Circular security is complete for KDM security (Q2692344) (← links)
• Updatable public key encryption in the standard model (Q2697895) (← links)
• Completeness of Single-Bit Projection-KDM Security for Public Key Encryption (Q2790040) (← links)
• Bounded KDM Security from iO and OWF (Q2827740) (← links)
• On the Power of Secure Two-Party Computation (Q2829222) (← links)
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE (Q2829234) (← links)
• Circular Security Separations for Arbitrary Length Cycles from LWE (Q2829235) (← links)
• Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
• Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions (Q2953781) (← links)
• Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
• The Geometry of Lattice Cryptography (Q3092183) (← links)
• Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing (Q3092366) (← links)
• Reproducible Circularly-Secure Bit Encryption: Applications and Realizations (Q3457112) (← links)
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
• Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption (Q4915998) (← links)
• Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
• Master-Key KDM-Secure IBE from Pairings (Q5041155) (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
• The KDM-CCA Security of REACT (Q5056009) (← links)
• Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption (Q5267417) (← links)
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles (Q5738789) (← links)
• Candidate iO from homomorphic encryption schemes (Q6109075) (← links)