One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
How watermarking adds value to digital content
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Traitor Tracing with Constant Transmission Rate
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
Hiding circuit topology from unbounded reverse engineers
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Message-Based traitor tracing with optimal ciphertext rate
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
How to keep a secret: leakage deterring public-key cryptosystems
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.00 |
This paper introduces a method for tracking different copies of functionally equivalent algorithms containing identification marks known to the attacker. Unlike all previous solutions, the new technique does not rely on any marking assumption and leads to a situation where each copy is either traceable or so severely damaged that it becomes impossible to store in polynomial space or run in polynomial time. Although RSA-related, the construction is particularly applicable to confidential block-ciphers such as SkipJack, RC4, GOST 28147-89, GSM A5, COMP128, TIA CAVE or other proprietary executables distributed to potentially distrusted users.