Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Prudent Engineering Practice for Cryptographic Protocols
IEEE Transactions on Software Engineering
ACM SIGOPS Operating Systems Review
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Security Engineering: A Guide to Building Dependable Distributed Systems
Security Engineering: A Guide to Building Dependable Distributed Systems
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Robustness Principles for Public Key Protocols
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Anonymous Communication and Anonymous Cash
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the First International Workshop on Information Hiding
A Bulk Data Encription Algorithm
Fast Software Encryption, Cambridge Security Workshop
Two Practical and Provably Secure Block Ciphers: BEARS and LION
Proceedings of the Third International Workshop on Fast Software Encryption
All-or-Nothing Encryption and the Package Transform
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
Analysis of the SSL 3.0 protocol
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
A digital fountain approach to asynchronous reliable multicast
IEEE Journal on Selected Areas in Communications
Secure deletion for a versioning file system
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Scrambling for lightweight censorship resistance
SP'11 Proceedings of the 19th international conference on Security Protocols
| Hi-index | 0.00 |
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block ciphers, or using an arbitrary mix of different decryption algorithms – such as any three keys out of two AES keys, a 3DES key, an RSA key and a one-time pad. We also provide a new way to combine different types of primitive, such as encryption and signature. For example, Alice can construct a convertible signature that only Bob can verify, but which he can make world-verifiable using an AES key. We can incorporate even more exotic primitives, such as micropayments and puzzles, into compound constructs. Previously, there had been two basic ways to combine cryptographic primitives. One could either design a compound primitive, perhaps using the homomorphic properties of discrete exponentiation, or one could embed several primitives into a protocol. Neither is ideal for all applications, and both have been extremely vulnerable to design errors. We provide a third construction that also allows the designer to do new things. We show, for example, how to incorporate cyclic dominance into a cryptographic mechanism, and how it might be used in a digital election scheme. Our new construction not only complements existing ways of composing crypto primitives; it also has the virtue of simplicity.