Improved non-committing encryption schemes based on a general complexity assumption
From MaRDI portal
Recommendations
- Improved non-committing encryption with applications to adaptively secure protocols
- Adaptive and composable non-committing encryptions
- Non-committing encryption from -hiding
- Non-committing encryptions based on oblivious Naor-Pinkas cryptosystems
- Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
Cited in
(46)- Ring signatures: Stronger definitions, and constructions without random oracles
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Constant ciphertext-rate non-committing encryption from standard assumptions
- On selective-opening security of deterministic primitives
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
- On the power of secure two-party computation
- On black-box complexity of universally composable security in the CRS model
- Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting
- Non-committing encryption with constant ciphertext expansion from standard assumptions
- Adaptive security with quasi-optimal rate
- On Adaptively Secure Multiparty Computation with a Short CRS
- New constructions of efficient simulation-sound commitments using encryption and their applications
- Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
- Leakage-resilient cryptography from minimal assumptions
- Adaptive and composable non-committing encryptions
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Provable Security of BLAKE with Non-ideal Compression Function
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Improved non-committing encryption with applications to adaptively secure protocols
- Non-committing encryptions based on oblivious Naor-Pinkas cryptosystems
- Possibility and impossibility results for selective decommitments
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Cryptography and cryptographic protocols
- Efficient one-sided adaptively secure computation
- Non-committing encryption from -hiding
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Removing erasures with explainable hash proof systems
- Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
- Adaptively secure MPC with sublinear communication complexity
- Bounded Collusion ABE for TMs from IBE
- Triply adaptive UC NIZK
- New and improved constructions for partially equivocable public key encryption
- Deniable cryptosystems: simpler constructions and achieving leakage resilience
- Optimally-fair multi-party exchange without trusted parties
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- Compact selective opening security from LWE
- Deny whatever you want: dual-deniable public-key encryption
- Non-committing identity based encryption: constructions and applications
- Fully selective opening secure IBE from LWE
- Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting
- Cryptography in the multi-string model
This page was built for publication: Improved non-committing encryption schemes based on a general complexity assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536817)
