New and improved constructions for partially equivocable public key encryption

DOI10.1007/978-3-031-14791-3_9zbMATH Open1518.94078OpenAlexW4294698951MaRDI QIDQ6134818FDOQ6134818

Authors Benoît Libert, Alain Passelègue, Mahshid Riahinia 

Publication date 25 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-14791-3_9

zbMATH Keywords

non-committing encryptionstandard assumptionsciphertext rateequivocable encryption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Constant ciphertext-rate non-committing encryption from standard assumptions
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
• Optimal-rate non-committing encryption
• Improved non-committing encryption with applications to adaptively secure protocols

Cites Work

• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• scientific article; zbMATH DE number 1088227 (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?)
• A Pseudorandom Generator from any One-way Function
• Adaptive security with quasi-optimal rate
• All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
• Classical hardness of learning with errors
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Improved non-committing encryption with applications to adaptively secure protocols
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
• Non-committing encryption from \(\Phi\)-hiding
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
• On lattices, learning with errors, random linear codes, and cryptography
• Optimal-rate non-committing encryption
• Public-key encryption with simulation-based selective-opening security and compact ciphertexts
• Theory of Cryptography
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited In (5)

• New and improved constructions of non-malleable cryptographic protocols
• A New Construction of Multivariate Public Key Encryption Scheme through Internally Perturbed Plus
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Optimal-rate non-committing encryption

This page was built for publication: New and improved constructions for partially equivocable public key encryption

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