Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
From MaRDI portal
Recommendations
- On selective-opening security of deterministic primitives
- On the selective opening security of practical public-key encryption schemes
- Selective-Opening Security in the Presence of Randomness Failures
- Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting
- Public-key encryption with selective opening security from general assumptions
- (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
- Standard versus selective opening security: separation and equivalence results
- Non-malleability under selective opening attacks: implication and separation
- On selective-opening attacks against encryption schemes
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- Bit commitment using pseudorandomness
- Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
- Concurrent and resettable zero-knowledge in poly-logarithmic rounds
- Concurrent zero-knowledge
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Efficient oblivious transfer protocols
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Foundations of Cryptography
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1304087 (Why is no real title available?)
- scientific article; zbMATH DE number 1024061 (Why is no real title available?)
- scientific article; zbMATH DE number 1088228 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 1759794 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Identity-based encryption secure against selective opening attack
- Independent Zero-Knowledge Sets
- Lossy trapdoor functions and their applications
- Magic functions
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On the (Im)Possibility of Key Dependent Encryption
- On the Composition of Zero-Knowledge Proof Systems
- On the Generic Insecurity of the Full Domain Hash
- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
- Possibility and impossibility results for selective decommitments
- Probabilistic encryption
- Statistically-hiding commitment from any one-way function
- Tackling Adaptive Corruptions in Multicast Encryption Protocols
- Theory of Cryptography
- Theory of Cryptography
- Universal Arguments and their Applications
Cited in
(90)- All-but-many encryption
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- More constructions of lossy and correlation-secure trapdoor functions
- Practical public key encryption with selective opening security for receivers
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Non-interactive zero knowledge from sub-exponential DDH
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Oblivious transfer is in MiniQCrypt
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On selective-opening security of deterministic primitives
- Handling adaptive compromise for practical encryption schemes
- Security analysis of NIST CTR-DRBG
- Targeted lossy functions and applications
- Tightness subtleties for multi-user PKE notions
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Fully leakage-resilient signatures
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Simulation-based selective opening security for receivers under chosen-ciphertext attacks
- On tightly-secure (linkable) ring signatures
- Individual simulations
- Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting
- Receiver selective opening security for identity-based encryption in the multi-challenge setting
- The cost of adaptivity in security games on graphs
- Towards tight adaptive security of non-interactive key exchange
- Non-malleability under selective opening attacks: implication and separation
- Standard Security Does Imply Security Against Selective Opening for Markov Distributions
- Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
- Standard security does not imply security against selective-opening
- Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
- Selective opening security from simulatable data encapsulation
- Selective-Opening Security in the Presence of Randomness Failures
- Constructions secure against receiver selective opening and chosen ciphertext attacks
- Lossy key encapsulation mechanism and its applications
- (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
- Better key sizes (and attacks) for LWE-based encryption
- General construction of chameleon all-but-one trapdoor functions
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Tightly secure signatures from lossy identification schemes
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Standard security does not imply indistinguishability under selective opening
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- A quasipolynomial reduction for generalized selective decryption on trees
- Possibility and impossibility results for selective decommitments
- Lossy trapdoor functions from homomorphic reproducible encryption
- Revisiting lower and upper bounds for selective decommitments
- Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Efficient one-sided adaptively secure computation
- On the exact round complexity of self-composable two-party computation
- CCA security and trapdoor functions via key-dependent-message security
- Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
- Minicrypt primitives with algebraic structure and applications
- Let attackers program ideal models: modularity and composability for adaptive compromise
- Classically verifiable NIZK for QMA with preprocessing
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Compact and tightly selective-opening secure public-key encryption schemes
- From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
- Simulation-based bi-selective opening security for public key encryption
- How to build a trapdoor function from an encryption scheme
- Augmented random oracles
- Instantiability of classical random-oracle-model encryption transforms
- Non-interactive zero-knowledge from non-interactive batch arguments
- Predicate encryption with selective-opening security for receivers: formal definition, generic construction, and concrete instantiations for several primitives
- Combinatorially homomorphic encryption
- Tighter security for generic authenticated key exchange in the QROM
- Selective opening security in the quantum random oracle model, revisited
- SoK: public key encryption with openings
- Compact selective opening security from LWE
- Lossy cryptography from code-based assumptions
- Non-interactive zero-knowledge from LPN and MQ
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Chosen ciphertext security via BARGs
- Batch arguments to NIZKs from one-way functions
- Non-malleable subvector commitments
- Fully selective opening secure IBE from LWE
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Efficient oblivious transfer for one-sided active adaptive adversaries
- Generic constructions of compact and tightly selective-opening secure public-key encryption schemes
- Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- Insight of the protection for data security under selective opening attacks
- IBE with tight security against selective opening and chosen-ciphertext attacks
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
- Secret sharing with statistical privacy and computational relaxed non-malleability
This page was built for publication: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627426)
