Distributing the encryption and decryption of a block cipher
From MaRDI portal
Publication:2572965
DOI10.1007/s10623-003-1719-4zbMath1136.94322OpenAlexW2051164878WikidataQ122169060 ScholiaQ122169060MaRDI QIDQ2572965
Huaxiong Wang, Peter R. Wild, Reihaneh Safavi-Naini
Publication date: 7 November 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-003-1719-4
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (7)
Public-Key Puncturable Encryption: Modular and Compact Constructions ⋮ Anonymity in shared symmetric key primitives ⋮ Generalised cumulative arrays in secret sharing ⋮ Cheating-immune secret sharing schemes from codes and cumulative arrays ⋮ Sharing many secrets with computational provable security ⋮ The combinatorics of generalised cumulative arrays ⋮ Shared generation of pseudo-random functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple assignment scheme for sharing secret
- Cascade ciphers: The importance of being first
- Optimal linear perfect hash families
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Robust and efficient sharing of RSA functions.
- How to share a function securely
- Redistribution of Mechanical Secret Shares
- How to share a secret
- Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures
- Explicit constructions of perfect hash families from algebraic curves over finite fields
This page was built for publication: Distributing the encryption and decryption of a block cipher