Solved and unsolved problems in number theory
Solved and unsolved problems in number theory
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Fast algorithms under the extended riemann hypothesis: A concrete estimate
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Efficient factoring based on partial information
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Controlled gradual disclosure schemes for random bits and their applications
CRYPTO '89 Proceedings on Advances in cryptology
How to simultaneously exchange secrets by general assumptions
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
ACM SIGACT News
International Journal of Applied Cryptography
On complete primitives for fairness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
| Hi-index | 0.00 |
A protocol is presented whereby two adversaries may exchange secrets, though neither trusts the other. The secrets are the prime factors of their publicly announced composite numbers. The two adversaries can exchange their secrets bit by bit, but each fears the other will cheat by sending “junk”bits. To solve this problem we show how each of the two can prove, for each bit delivered, that the bit is good. Applications are suggested to such electronic business transactions as the signing of contracts and the sending of certified electronic mail.