A randomized protocol for signing contracts
Communications of the ACM
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
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Verifiable disclose for secrets and applications (abstract)
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Elements of information theory
Elements of information theory
More general completeness theorems for secure two-party computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Generalized Zig-zag Functions and Oblivious Transfer Reductions
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
New Results on Unconditionally Secure Distributed Oblivious Transfer
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
On Unconditionally Secure Distributed Oblivious Transfer
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Coin flipping by telephone a protocol for solving impossible problems
ACM SIGACT News - A special issue on cryptography
ACM SIGACT News - A special issue on cryptography
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Lower bounds for oblivious transfer reductions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Oblivious transfer is symmetric
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Oblivious transfers and intersecting codes
IEEE Transactions on Information Theory - Part 1
Oblivious-Transfer Amplification
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Statistical Security Conditions for Two-Party Secure Function Evaluation
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Simple Direct Reduction of String (1,2)-OT to Rabin's OT without Privacy Amplification
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Composing Quantum Protocols in a Classical Environment
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Bit commitment in the bounded storage model: tight bound and simple optimal construction
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
| Hi-index | 0.00 |
The standard security definition of unconditional secure function evaluation, which is based on the ideal/real model paradigm, has the disadvantage of being overly complicated to work with in practice. On the other hand, simpler ad-hoc definitions tailored to special scenarios have often been flawed. Motivated by this unsatisfactory situation, we give an information-theoretic security definition of secure function evaluation which is very simple yet provably equivalent to the standard, simulation-based definitions.