Optimal-rate non-committing encryption

DOI10.1007/978-3-319-70700-6_8MaRDI QIDQ1701444zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Oxana Poburinnaya, Mariana Raykova

Publication date 23 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-70700-6_8

zbMATH Keywords

adaptive securitynon-committing encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constant ciphertext-rate non-committing encryption from standard assumptions
• Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Adaptive and composable non-committing encryptions
• New and improved constructions for partially equivocable public key encryption

Cited in

(8)

• Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
• Better two-round adaptive multi-party computation
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Receiver Selective Opening Security from Indistinguishability Obfuscation
• Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• New and improved constructions for partially equivocable public key encryption

This page was built for publication: Optimal-rate non-committing encryption

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