Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
5,929
Efficient Oblivious Transfer Schemes
- In Proceedings of 2002 International Workshop on Practice and Theory in Public-Key Cryptography (PKC 02), Lecture Notes in Computer Science 2274
, 2001
"... In this paper we propose a very e#cient (string) OT 1 n scheme for any n # 2. We build our OT 1 n scheme from fundamental cryptographic techniques directly. It achieves optimal e#ciency in the number of rounds and the total number of exchanged messages for the case that the receiver 's c ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
is at least as strong as the hardness of the decisional Di#e-Hellman problem. We extend our OT 1 n scheme to distributed oblivious transfer schemes. Our distributed OT 1 n scheme takes full advantage of the research results of secret sharing and is conceptually simple. It achieves better security than
An Oblivious Transfer Scheme in Gaussian Arithmetic
"... Most oblivious transfer schemes blend the capabilities of modern high-speed computers with Gaussian arithmetic. In this expository note, the basic mathematics used in a scheme that converts a remote call for “heads ” or “tails ” into the problem of factoring a large number is discussed. ..."
Abstract
- Add to MetaCart
Most oblivious transfer schemes blend the capabilities of modern high-speed computers with Gaussian arithmetic. In this expository note, the basic mathematics used in a scheme that converts a remote call for “heads ” or “tails ” into the problem of factoring a large number is discussed.
Efficient k-out-ofn oblivious transfer schemes,”
- Journal of Universal Computer Science,
, 2008
"... Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k out of n digital goods from a merchant without learning information about other n−k ..."
Abstract
-
Cited by 23 (0 self)
- Add to MetaCart
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k out of n digital goods from a merchant without learning information about other n
Optimal Transfer Schemes for Switching Controllers
"... In this paper, we develop two general schemes for reducing the performance degradation caused by a signal substitution at the plant input. Such substitutions arise in modern control systems where we may transfer from manual to automatic, or between alternative controllers as operating points or perf ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In this paper, we develop two general schemes for reducing the performance degradation caused by a signal substitution at the plant input. Such substitutions arise in modern control systems where we may transfer from manual to automatic, or between alternative controllers as operating points
Twin Pillars of Direct Benefit Transfer Scheme in India
"... The Government of India has launched various schemes for rural development and welfare in areas of employment, education, health, housing such as MNREGA, RSBY, PMGSY, SLBC, SSP to name a few. Also, Indian Government along with Reserve Bank of India is paving way towards Financial Inclusion- bringing ..."
Abstract
- Add to MetaCart
- bringing banking services to lower level of pyramid. These two efforts are being integrated with the Direct Benefit Transfer Scheme or commonly refer as DBT scheme which was launched on 1 st Jan 2013. The Direct Benefit Transfer scheme was launched to curb the rampant leakages, corruption and frauds
Enhancement of Non-Interactive Oblivious Transfer Scheme
"... In a t-out-n oblivious transfer, the receiver can only receive t messages out of n messages sent by the sender; and the sender has no idea about which ones have been received. Recently, Mu et al. proposed a non-interactive oblivious transfer scheme that can reduce many communication loads. However, ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In a t-out-n oblivious transfer, the receiver can only receive t messages out of n messages sent by the sender; and the sender has no idea about which ones have been received. Recently, Mu et al. proposed a non-interactive oblivious transfer scheme that can reduce many communication loads. However
Efficient 1-out-n oblivious transfer schemes
- In Proc. of PKC 2002, LNCS 2274
, 2002
"... Abstract. In this paper we propose an efficient (string) OT 1 n scheme for any n ≥ 2. We build our OT 1 n scheme from fundamental cryptographic techniques directly. It achieves optimal efficiency in terms of the number of rounds and the total number of exchanged messages for the case that the receiv ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
on hardness of the decisional Diffie-Hellman problem. We extend our OT 1 n scheme to distributed oblivious transfer schemes. Our distributed OT 1 n scheme takes full advantage of the research results of secret sharing and is conceptually simple. It achieves better security than Naor and Pinkas’s scheme does
A Convergent Transfer Scheme To The Core Of A TU-Game
, 1998
"... We present an algorithm for computing points in the core of a game with transferable utility. We prove that it converges if and only if the core of the game is nonempty. The algorithm resembles the transfer scheme model introduced in Stearns [13]. AMS Classifications: D90. Key Words: TU-game, c ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
We present an algorithm for computing points in the core of a game with transferable utility. We prove that it converges if and only if the core of the game is nonempty. The algorithm resembles the transfer scheme model introduced in Stearns [13]. AMS Classifications: D90. Key Words: TU
Improvement of One Adaptive Oblivious Transfer Scheme
"... In 2011, the authors [8] presented an adaptive oblivious transfer (OT) scheme based on Decisional 3-Party Diffie-Hellman (3DDH) assumption. The encryption used in the scheme is a combination of the Boneh-Boyen IBE scheme and a variation of the Hohenberger-Waters signature. The scheme is somewhat ine ..."
Abstract
- Add to MetaCart
In 2011, the authors [8] presented an adaptive oblivious transfer (OT) scheme based on Decisional 3-Party Diffie-Hellman (3DDH) assumption. The encryption used in the scheme is a combination of the Boneh-Boyen IBE scheme and a variation of the Hohenberger-Waters signature. The scheme is somewhat
Improvement of Camenisch-Neven-Shelat oblivious transfer scheme,”
- International Journal of Network Security,
, 2015
"... Abstract In 2007, Camenisch, Neven and Shelat proposed an adaptive oblivious transfer (OT) scheme in which a sender has n messages, of which a receiver can adaptively choose to receive k one-after-the-other. In this paper, we show that the scheme has a drawback that the sender can serve a single re ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract In 2007, Camenisch, Neven and Shelat proposed an adaptive oblivious transfer (OT) scheme in which a sender has n messages, of which a receiver can adaptively choose to receive k one-after-the-other. In this paper, we show that the scheme has a drawback that the sender can serve a single
Results 1 - 10
of
5,929
