STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Journal of the ACM (JACM)
How to share a function securely
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Encryption and Secure Computer Networks
ACM Computing Surveys (CSUR)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Failsafe Key Escrow
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Proceedings of the 4th ACM conference on Computer and communications security
How to break fraud-detectable key recovery
ACM SIGOPS Operating Systems Review
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Escrow Encryption Systems Visited: Attacks, Analysis and Designs
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Key-Privacy in Public-Key Encryption
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A New type of ``Magic Ink'' Signatures - Towards Transcript-Irrelevant Anonymity Revocation
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Protocols that hide user's preferences in electronic transactions
Computer Networks: The International Journal of Computer and Telecommunications Networking
Protocols that hide user's preferences in electronic transactions
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the difficulty of software key escrow
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Binding ElGamal: a fraud-detectable alternative to key-escrow proposals
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A secure signature scheme from bilinear maps
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Anonymity on Paillier's trap-door permutation
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity
Information Sciences: an International Journal
Affiliation-hiding key exchange with untrusted group authorities
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Private discovery of common social contacts
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Universally anonymizable public-key encryption
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
SP'04 Proceedings of the 12th international conference on Security Protocols
The sampling twice technique for the RSA-Based cryptosystems with anonymity
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
| Hi-index | 0.00 |
The Law Enforcement Agency Field (LEAF), which in Clipper is appended to the ciphertext, allows the Law Enforcement Agency to trace the sender and receiver. To prevent users of Clipper to delete the LEAF, the Clipper decryption box will not decrypt if the correct LEAF is not present. Such a solution requires the implementation to be tamperproof. In this paper we propose an alternative approach to achieve traceability. Our solution is based on the computational complexity of some well known problems in number theory. So, our scheme does not require a tamperproof implementation, nor a secret algorithm. Its applications extend beyond key escrow.