An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Probabilistic encryption & how to play mental poker keeping secret all partial information
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
PROBABILISTIC ALGORITHM IN FINITE FIELDS
PROBABILISTIC ALGORITHM IN FINITE FIELDS
Proceedings on Advances in cryptology---CRYPTO '86
Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Mental poker game based on a bit commitment scheme through network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Symmetric Public-Key Encryption
CRYPTO '85 Advances in Cryptology
A Secure Poker Protocol that Minimizes the Effect of Player Coalitions
CRYPTO '85 Advances in Cryptology
A Framework for the Study of Cryptographic Protocols
CRYPTO '85 Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
A secure mental poker protocol over the internet
ACSW Frontiers '03 Proceedings of the Australasian information security workshop conference on ACSW frontiers 2003 - Volume 21
Dropout-tolerant TTP-free mental poker
TrustBus'05 Proceedings of the Second international conference on Trust, Privacy, and Security in Digital Business
| Hi-index | 0.00 |
Investigating the capabilities of public key and related cryptographic techniques has recently become an important area of cryptographic research. In this paper we present some new algorithms and cryptographic protocols (Cryptoprotocols) which enlarge the range of applications of public key systems and enable us to perform certain transactions in communication networks. The basic cryptographic tools used are Rabin's Oblivious Transfer Protocol and an algorithm we developed for Number Embedding which is provably hard to invert.We introduce the protocol Subscription to a Public Key, which gives a way to transfer keys over insecure communication channels and has useful applications to cryptosystems. We develop the Secret Blocking Protocol, specified as follows: 'A transfers a secret to B, B can block the message. If B does not block it, there is a probability P that he might get it. (1/2 驴 P