Constant ciphertext-rate non-committing encryption from standard assumptions

DOI10.1007/978-3-030-64375-1_3MaRDI QIDQ2055714zbMATH OpenOpenAlexFDO

Authors Zvika Brakerski, Pedro Branco, Nico Döttling, Sanjam Garg, Giulio Malavolta

Publication date 1 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-64375-1_3

zbMATH Keywords

adaptively secure multiparty computationnon-committing encryption

Mathematics Subject Classification ID

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

Recommendations

• Optimal-rate non-committing encryption
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
• New and improved constructions for partially equivocable public key encryption
• scientific article; zbMATH DE number 1759794

Cited in

(22)

• Cryptography with constant input locality
• Optimal-rate non-committing encryption
• Batch-OT with optimal rate
• Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Amortizing rate-1 OT and applications to PIR and PSI
• Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
• Adaptive and composable non-committing encryptions
• Improved non-committing encryption with applications to adaptively secure protocols
• New Constructions of Constant Size Ciphertext HIBE Without Random Oracle
• Algebraic restriction codes and their applications
• New and improved constructions for partially equivocable public key encryption
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• A framework for statistically sender private OT with optimal rate
• Rate-1 fully local somewhere extractable hashing from DDH
• Two-round maliciously-secure oblivious transfer with optimal rate
• 10-party sublinear secure computation from standard assumptions
• Designated-verifier SNARGs with one group element
• Somewhat homomorphic encryption from linear homomorphism and sparse LPN
• Non-committing identity based encryption: constructions and applications
• Generic constructions of compact and tightly selective-opening secure public-key encryption schemes
• Slightly sublinear trapdoor hash functions and PIR from low-noise LPN

This page was built for publication: Constant ciphertext-rate non-committing encryption from standard assumptions

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