All-But-Many Lossy Trapdoor Functions

No abstract is available for this paper.

• Publication year

  2012

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2012-04-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-29011-4_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Identity-Based Encryption Secure against Selective Opening Attack

  2011cited by this paper
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security

  2011influential reference
• How to Garble Arithmetic Circuits

  2011cited by this paper
• More Constructions of Lossy and Correlation-Secure Trapdoor Functions

  2010cited by this paper
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups

  2010influential reference
• Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures

  2010cited by this paper
• Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks

  2010influential reference
• Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions

  2010cited by this paper
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts

  2010cited by this paper
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

  2009influential reference
• Hedged Public-Key Encryption: How to Protect against Bad Randomness

  2009cited by this paper
• Realizing Hash-and-Sign Signatures under Standard Assumptions

  2009cited by this paper
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

  2009cited by this paper
• Chosen-Ciphertext Security via Correlated Products

  2009cited by this paper
• Efficient Non-interactive Universally Composable String-Commitment Schemes

  2009cited by this paper
• Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

  2008cited by this paper
• Lossy trapdoor functions and their applications

  2008influential reference
• Tag-KEM/DEM: A New Framework for Hybrid Encryption

  2008cited by this paper
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles

  2008cited by this paper
• A Practical and Tightly Secure Signature Scheme Without Hash Function

  2007cited by this paper
• Strongly Unforgeable Signatures Based on Computational Diffie-Hellman

  2006cited by this paper
• Evaluating 2-DNF Formulas on Ciphertexts

  2005cited by this paper
• Efficient Identity-Based Encryption Without Random Oracles

  2005influential reference
• Identity-Based Chameleon Hash and Applications

  2004cited by this paper
• Chosen-Ciphertext Security from Identity-Based Encryption

  2004cited by this paper
• A Note on An Encryption Scheme of Kurosawa and Desmedt

  2004cited by this paper
• Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

  2002cited by this paper
• A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

  2001cited by this paper
• Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

  2001cited by this paper
• Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements

  2000cited by this paper
• Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

  2000cited by this paper
• Chameleon Signatures

  2000cited by this paper
• On Formal Models for Secure Key Exchange

  1999cited by this paper
• Magic functions

  1999cited by this paper
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  1999influential reference
• Number-theoretic constructions of efficient pseudo-random functions

  1997cited by this paper
• Publicly Verifiable Secret Sharing

  1996cited by this paper
• Adaptively secure multi-party computation

  1996cited by this paper
• A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

  1993cited by this paper
• Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

  1991cited by this paper
• Non-malleable cryptography

  1991cited by this paper
• Probabilistic Encryption

  1984cited by this paper
• Integer Programming with a Fixed Number of Variables

  1983cited by this paper

• On new variants of funcCPA security and related CCA-secure constructions

  2025cites this paper
• Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK

  2025cites this paper
• Forgetful Encryption

  2025cites this paper
• Leveraging Small Message Spaces for CCA1 Security in Additively Homomorphic and BGN-type Encryption

  2024influential citation
• Generic Constructions of Compact and Tightly Selective-Opening Secure Public-key Encryption Schemes

  2023cites this paper
• SoK: Public Key Encryption with Openings

  2023influential citation
• Compact Lossy Trapdoor Functions and Selective Opening Security From LWE

  2023influential citation
• Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions

  2022cites this paper
• Receiver selective opening security for identity-based encryption in the multi-challenge setting

  2022cites this paper
• The Boneh-Katz Transformation, Revisited: Pseudorandom/Obliviously-Samplable PKE from Lattices and Codes and Its Application

  2021cites this paper
• Targeted Lossy Functions and Applications

  2021cites this paper
• Abuse Resistant Law Enforcement Access Systems

  2021cites this paper
• Selective-Opening Security for Public-Key Encryption in the Presence of Parameter Subversion

  2021influential citation
• Simulation-Based Bi-Selective Opening Security for Public Key Encryption

  2021cites this paper
• SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions

  2021cites this paper
• Possibility and Impossibility Results for Receiver Selective Opening Secure PKE in the Multi-Challenge Setting

  2020cites this paper
• IBE with tight security against selective opening and chosen-ciphertext attacks

  2020cites this paper
• Efficient chameleon hash functions in the enhanced collision resistant model

  2020cites this paper
• Simulation-Sound Arguments for LWE and Applications to KDM-CCA2 Security

  2020cites this paper
• Public-Key Cryptography – PKC 2020: 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4–7, 2020, Proceedings, Part I

  2020cites this paper
• Toward RSA-OAEP Without Random Oracles

  2020cites this paper
• Extremal Set Theory and LWE Based Access Structure Hiding Verifiable Secret Sharing with Malicious Majority and Free Verification

  2020cites this paper
• Privacy preserving search services against online attack

  2020cites this paper
• Tightly Secure Lossy Trapdoor Functions: Constructions and Applications

  2019cites this paper
• Data security against receiver corruptions: SOA security for receivers from simulatable DEMs

  2019cites this paper
• On Improving Communication Complexity in Cryptography

  2019cites this paper
• Lossy Algebraic Filters with Short Tags

  2019influential citation
• Practical public key encryption with selective opening security for receivers

  2019cites this paper
• Efficient Fully-Leakage Resilient One-More Signature Schemes

  2019cites this paper
• Regularly Lossy Functions and Their Applications

  2018cites this paper
• Simulation-based selective opening security for receivers under chosen-ciphertext attacks

  2018cites this paper
• Regularly Lossy Functions and Applications

  2018cites this paper
• Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions

  2018cites this paper
• Public-Key Encryption with Selective Opening Security from General Assumptions

  2018cites this paper
• Regular lossy functions and their applications in leakage-resilient cryptography

  2018cites this paper
• On the selective opening security of public-key encryption

  2017cites this paper
• Public-Key Encryption with Simulation-Based Sender Selective-Opening Security

  2017cites this paper
• Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness

  2017cites this paper
• All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE

  2017influential citation
• Insight of the protection for data security under selective opening attacks

  2017cites this paper
• All-But-Many Lossy Trapdoor Functions from Lattices and Applications

  2017influential citation
• Leakage resilient CCA secure IBE with all-but-one lossy filter

  2016cites this paper
• Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts

  2016cites this paper
• Applied Cryptography and Network Security

  2016influential citation
• Selective opening security of practical public-key encryption schemes

  2016cites this paper
• Standard Security Does Not Imply Indistinguishability Under Selective Opening

  2016cites this paper
• Almost-Tight Identity Based Encryption Against Selective Opening Attack

  2016cites this paper
• Deterministic Public-Key Encryption Under Continual Leakage

  2016cites this paper
• Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited

  2015cites this paper
• n-Evasive all-but-many lossy trapdoor function and its constructions

  2015influential citation
• Non-malleability Under Selective Opening Attacks: Implication and Separation

  2015cites this paper
• Practical key-dependent message chosen-ciphertext security based on decisional composite residuosity and quadratic residuosity assumptions

  2015cites this paper
• SelectiveOpening Secure Functional Encryption

  2015cites this paper
• On the Selective Opening Security of Practical Public-Key Encryption Schemes

  2015cites this paper
• Compactly Hiding Linear Spans - Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications

  2015cites this paper
• CCA Secure PKE with Auxiliary Input Security and Leakage Resiliency

  2015cites this paper
• Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms

  2015cites this paper
• Standard versus Selective Opening Security: Separation and Equivalence Results

  2014cites this paper
• On Selective-Opening Attacks against Encryption Schemes

  2014cites this paper
• Public‐key encryption scheme with selective opening chosen‐ciphertext security based on the Decisional Diffie–Hellman assumption

  2014cites this paper
• Enhanced Chosen-Ciphertext Security and Applications

  2014cites this paper
• Secure Multi-party Computation based on m-out-n OT

  2014cites this paper
• Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and Implications

  2014cites this paper
• All-But-Many Encryption

  2014cites this paper
• Identity-Based Encryption Secure Against Selective Opening Chosen-Ciphertext Attack

  2014cites this paper
• General Construction of Chameleon All-But-One Trapdoor Functions and Their Applications

  2014cites this paper
• Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited

  2013cites this paper
• Fixing the Sender-Equivocable Encryption Scheme in Eurocrypt 2010

  2013cites this paper
• Leakage-Resilient Chosen-Ciphertext Secure Public-Key Encryption from Hash Proof System and One-Time Lossy Filter

  2013cites this paper
• Circular Chosen-Ciphertext Security with Compact Ciphertexts

  2013cites this paper
• Tightly secure signatures and public-key encryption

  2012cites this paper
• Selective Opening Chosen Ciphertext Security Directly from the DDH Assumption

  2012cites this paper
• Optimal Reductions of Some Decisional Problems to the Rank Problem

  2012cites this paper
• A Framework for Efficient Fully-Equipped UC Commitments

  2012cites this paper
• Security Against Selective Opening Attacks

  2012influential citation
• Circular and KDM Security for Identity-Based Encryption

  2012cites this paper
• On definitions of selective opening security

  2012cites this paper
• Hierarchical Identity-Based Lossy Trapdoor Functions

  2012cites this paper
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security

  2011influential citation
• SO-CCA Secure PKE from Pairing based ABM-LTFs

  year unknowninfluential citation
• Partitioning: Fully Compact and (almost) Tightly Secure Cryptography

  year unknowncites this paper