On the Information-theoretic Security of Combinatorial All-or-nothing Transforms

On the Information-theoretic Security of Combinatorial All-or-nothing Transforms

All-or-nothing transforms (AONTs) were proposed by Rivest as a message preprocessing technique for encrypting data to protect against brute-force attacks, and have numerous applications in cryptography and information security. Later the unconditionally secure AONTs and their combinatorial character...

Full description

Bibliographic Details
Main Authors: Akao, S. (Author), Esfahani, N.N (Author), Gu, Y. (Author), Miao, Y. (Author), Sakurai, K. (Author)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers Inc. 2022
Subjects:
All or nothings
Brute-force attack
Cryptography
Electronic mail
Information security
Information- theoretic securities
Information theory
Perfect securities
Pre-processing techniques
Probability distribution
Probability distributions
Probability: distributions
Random variables
Security
Security of data
Security properties
Transforms
Unconditionally secure
Upper bound
Upper Bound
Online Access:View Fulltext in Publisher

Internet

View Fulltext in Publisher

Similar Items