New and improved constructions for partially equivocable public key encryption

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

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

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

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

zbMATH Keywords

non-committing encryptionstandard assumptionsciphertext rateequivocable encryption

Mathematics Subject Classification ID

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

Cites Work

• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Trapdoors for hard lattices and new cryptographic constructions
• A Pseudorandom Generator from any One-way Function
• Classical hardness of learning with errors
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved non-committing encryption with applications to adaptively secure protocols
• Non-committing Encryption from Φ-hiding
• All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
• Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Adaptive Security with Quasi-Optimal Rate
• Optimal-rate non-committing encryption
• New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
• Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
• Non-committing encryption with constant ciphertext expansion from standard assumptions

Cited In (3)

• 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

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)