Distributing the Encryption and Decryption of a Block Cipher

Authors:
Keith M. Martin;Rei Safavi-Naini;Huaxiong Wang;Peter R. Wild
Affiliations:
Information Security Group, Royal Holloway, University of London, Surrey, UK TW20 0EX;School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia 2522;Department of Computing, Macquarie University, North Ryde, Australia 2109;Information Security Group, Royal Holloway, University of London, Surrey, UK TW20 0EX
Venue:
Designs, Codes and Cryptography
Year:
2005

Citing 16
Cited 5

How to share a function securely

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the power of cascade ciphers

ACM Transactions on Computer Systems (TOCS)
Optimal linear perfect hash families

Journal of Combinatorial Theory Series A
How to share a secret

Communications of the ACM
Explicit constructions of perfect hash families from algebraic curves over finite fields

Journal of Combinatorial Theory Series A
Sharing Block Ciphers

ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Efficient Generation of Shared RSA Keys (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries

FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Split Knowledge Generation of RSA Parameters

Proceedings of the 6th IMA International Conference on Cryptography and Coding
Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Cumulative Arrays and Geometric Secret Sharing Schemes

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Robust threshold DSS signatures

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Redistribution of mechanical secret shares

FC'02 Proceedings of the 6th international conference on Financial cryptography
Threshold MACs

ICISC'02 Proceedings of the 5th international conference on Information security and cryptology

Shared generation of pseudo-random functions

Journal of Complexity - Special issue on coding and cryptography
Generalised Cumulative Arrays in Secret Sharing

Designs, Codes and Cryptography
Non-interactive distributed encryption: a new primitive for revocable privacy

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Threshold and proactive pseudo-random permutations

TCC'06 Proceedings of the Third conference on Theory of Cryptography
Sharing many secrets with computational provable security

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In threshold cryptography, the goal is to distribute the computation of basic cryptographic primitives across a number of nodes in order to relax trust assumptions on individual nodes, as well as to introduce a level of fault-tolerance against node compromise. Most threshold cryptography has previously looked at the distribution of public key primitives, particularly threshold signatures and threshold decryption mechanisms. In this paper, we look at the application of threshold cryptography to symmetric primitives, and in particular the encryption or decryption of a symmetric key block cipher. We comment on some previous work in this area and then propose a model for shared encryption / decryption of a block cipher. We will present several approaches to enable such systems and will compare them.