A randomized protocol for signing contracts
Communications of the ACM
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
| Hi-index | 0.00 |
In this paper, we introduce a new notion of conditional converge cast (CCC), by adding the conditional property to converge cast. A CCC protocol with predicate Q is a three-party protocol which involves two senders S0 and S1 and a receiver R. S0 owns a secret x and a message m0, so does S1 with y and m1. In a protocol, S0 and S1 send their messages to R in a masked form. R obtains the message depending on the value of Q(x,y), i.e. R obtains m0 if Q(x,y)=0, or m1 otherwise. The secrets, x and y, are not revealed to R or the other sender, and Q(x,y) is not revealed to S0 and S1. In addition to the formulation, we propose a concrete scheme for conditional converge cast with the “equality” predicate.