Encrypting problem instances: Or ... can you take advantage of someone without having to trust him?
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
On hiding information form an oracle
Journal of Computer and System Sciences
Journal of Cryptology
Computer security by redefining what a computer is
NSPW '92-93 Proceedings on the 1992-1993 workshop on New security paradigms
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Journal of Complexity - Special issue on coding and cryptography
Homomorphic Encryption with CCA Security
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Evaluating branching programs on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Information-theoretic security without an honest majority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Privacy preserving keyword searches on remote encrypted data
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Public key encryption with conjunctive field keyword search
WISA'04 Proceedings of the 5th international conference on Information Security Applications
| Hi-index | 0.00 |
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previously limited to stand-alone and/or honest-but-curious security. In this work, we apply recent results on "non-malleable homomorphic encryption" to construct new protocols with Universally Composable security against active corruption, for certain interesting tasks. Also, we use our techniques to develop non-malleable homomorphic encryption that can handle homomorphic operations involving more than one ciphertext.