STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Multiparty Unconditionally Secure Protocols (Abstract)
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Cryptographic techniques for privacy-preserving data mining
ACM SIGKDD Explorations Newsletter
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Zero-knowledge proofs of knowledge without interaction
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Public-key encryptions tolerating adaptive and composable adversaries
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Error-free, multi-bit non-committing encryption with constant round complexity
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
| Hi-index | 0.00 |
Designing non-committing encryptions tolerating adaptive adversaries, who are able to corrupt parties on the fly in the course of computation has been a challenge task. In this paper, we make progress in this area. First, we introduce a new notion called oblivious Naor-Pinkas cryptosystems that benefits us to extract the randomness used to generate local public keys and thus enable us to construct corresponding simulator for a given adaptive adversary in a real-world protocol. We then give a simple construction of non-committing encryptions based on oblivious Naor-Pinkas cryptosystems. We show that the proposed non-committing encryption scheme is provably secure against an adaptive PPT adversary assuming that the decisional Diffie-Hellman problem is hard.