All-or-nothing encryption and the package transform

DOI10.1007/BFB0052348zbMATH Open1385.94067OpenAlexW1575126375MaRDI QIDQ4639342FDOQ4639342

Authors: Ronald L. Rivest 

Publication date: 9 May 2018

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0052348

Recommendations

• A new mode of using all-or-nothing transforms
• scientific article; zbMATH DE number 1759790
• Exposure-resilient functions and all-or-nothing transforms
• Publication:4941876
• scientific article; zbMATH DE number 1759277

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Low-exponent RSA with related messages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two practical and provably secure block ciphers: BEAR and LION
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (30)

• Fault-tolerant quantum secure direct communication protocol based on decoherence-free states
• A scalable post-quantum hash-based group signature
• Enhancing data security in ad hoc networks based on multipath routing
• Quantum public-key cryptosystem
• Title not available (Why is that?)
• Hadamard matrices modulo 5
• Exploiting randomness on continuous sets
• Towards a theory of data entanglement
• A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack
• ParaDiSE: efficient threshold authenticated encryption in fully malicious model
• Linear \((2, p, p)\)-AONTs exist for all primes \(p\)
• Invertible binary matrices with maximum number of \(2\)-by-\(2\) invertible submatrices
• All or nothing at all
• Breaking the Shin-Shin-Rhee remotely keyed encryption schemes
• Some new results on Hadamard modulo prime matrices
• Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms
• On security properties of all-or-nothing transforms
• Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
• A new mode of using all-or-nothing transforms
• Incompressible cryptography
• Short leakage resilient and non-malleable secret sharing schemes
• Leakage-resilient coin tossing
• (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
• Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
• Randomizing encryption mode
• An Application of Quasigroups in All-Or-Nothing Transform
• Title not available (Why is that?)
• Efficient Traitor Tracing from Collusion Secure Codes
• Network information flow
• On the local leakage resilience of linear secret sharing schemes

This page was built for publication: All-or-nothing encryption and the package transform

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