NM-CPA secure encryption with proofs of plaintext knowledge

DOI10.1007/978-3-319-22425-1_8MaRDI QIDQ1800583zbMATH OpenOpenAlexFDO

Authors Ben Smyth, Yoshikazu Hanatani, Hirofumi Muratani

Publication date 24 October 2018

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2009957
• scientific article; zbMATH DE number 2079934
• Verifiable elections that scale for free
• Combining Encryption and Proof of Knowledge in the Random Oracle Model
• Simplified Submission of Inputs to Protocols

Cited in

(1)

• Secret, verifiable auctions from elections

This page was built for publication: NM-CPA secure encryption with proofs of plaintext knowledge

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