An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption

DOI10.1007/978-3-662-48797-6_18zbMATH Open1396.94090OpenAlexW2295052252MaRDI QIDQ2811141FDOQ2811141

Takahiro Matsuda, Goichiro Hanaoka

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_18

Recommendations

• Asymptotically quasi-optimal cryptography
• From single-bit to multi-bit public-key encryption via non-malleable codes
• Efficient Binary Conversion for Paillier Encrypted Values
• Efficient implementation of hybrid encryption from coding theory
• On the optimality of non-linear computations of length-preserving encryption schemes
• Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
• Tweakable blockciphers with asymptotically optimal security
• scientific article; zbMATH DE number 1088907
• Optimization of the multivariate public key cryptosystem
• Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity

Mathematics Subject Classification ID

Cryptography (94A60)

This page was built for publication: An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption

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