Filters








289 Hits in 2.0 sec

Practical Fully Simulatable Oblivious Transfer with Sublinear Communication [chapter]

Bingsheng Zhang, Helger Lipmaa, Cong Wang, Kui Ren
2013 Lecture Notes in Computer Science  
We propose the first fully simulatable adaptive OT with sublinear communication under the DDH assumption in the plain model.  ...  During an adaptive k-out-of-N oblivious transfer (OT), a sender has N private documents, and a receiver wants to adaptively fetch k documents from them such that the sender learns nothing about the receiver's  ...  It achieves fully simulatable security with O( √ N ) communication in both the initialization phase and each transfer phase.  ... 
doi:10.1007/978-3-642-39884-1_8 fatcat:724accjte5cb3pf3lb5mrbudfe

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

Carmit Hazay, Yehuda Lindell
2008 Journal of Cryptology  
We also present a protocol for set intersection that is fully simulatable in the model of covert adversaries.  ...  Our protocol for secure pattern matching and one of our protocols for set intersection achieve security against malicious adversaries under a relaxed definition where one corruption case is simulatable  ...  For our protocols that achieve one-sided simulatability, we need an oblivious transfer protocol that achieves one-sided simulatability.  ... 
doi:10.1007/s00145-008-9034-x fatcat:iczlrgjhynezbivhyqvul2ctea

Secure Hamming Distance Based Computation and Its Applications [chapter]

Ayman Jarrous, Benny Pinkas
2009 Lecture Notes in Computer Science  
In particular, we present protocols which are secure in the sense of full simulatability against malicious adversaries.  ...  It can be used if the server's database contains N entries, at most N/ log N of which have individual values, and the rest are set to some default value.  ...  Oblivious Transfer. The paper uses 1-out-of-N oblivious transfer (OT N 1 ) as a basic building block.  ... 
doi:10.1007/978-3-642-01957-9_7 fatcat:2u6jdqkk3zflvhcoujltcdqgcm

Oblivious Transfer with Access Control : Realizing Disjunction without Duplication [chapter]

Ye Zhang, Man Ho Au, Duncan S. Wong, Qiong Huang, Nikos Mamoulis, David W. Cheung, Siu-Ming Yiu
2010 Lecture Notes in Computer Science  
Oblivious Transfer with Access Control (AC-OT) is a protocol which allows a user to obtain a database record with a credential satisfying the access policy of the record while the database server learns  ...  Fully-Simulatable Oblivious Transfer. We employ the fully-simulatable adaptive OT due to Camenisch et al. [5] .  ...  To our knowledge, the only fully-simulatable adaptive oblivious transfer including a signature in it is the construction proposed by Camenisch et al. [5] .  ... 
doi:10.1007/978-3-642-17455-1_7 fatcat:2yn3nlcp5fc3vlzpaen3p7tlmq

Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption [chapter]

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
2010 Lecture Notes in Computer Science  
At Asiacrypt 2009, Kurosawa and Nojima showed a fully simulatable adaptive oblivious transfer (OT) protocol under the DDH assumption in the standard model.  ...  However, Green and Hohenberger pointed out that the communication cost of each transfer phase is O(n), where n is the number of the sender's messages.  ...  Introduction Background Adaptive oblivious transfer is a notion introduced by Naor and Pinkas in [12] .  ... 
doi:10.1007/978-3-642-15317-4_12 fatcat:6n52xedcvradli7x5ychktmioe

Practical Adaptive Oblivious Transfer from Simple Assumptions [chapter]

Matthew Green, Susan Hohenberger
2011 Lecture Notes in Computer Science  
In an adaptive oblivious transfer (OT) protocol, a sender commits to a database of messages and then repeatedly interacts with a receiver in such a way that the receiver obtains one message per interaction  ...  protocol should: (1) support an efficient initialization phase where one commitment can support an arbitrary number of receivers who are guaranteed of having the same view of the database, (2) execute transfers  ...  We present an efficient, adaptive oblivious transfer protocol which is fully-simulatable under a simple, static assumption.  ... 
doi:10.1007/978-3-642-19571-6_21 fatcat:zmkpoyydvzfnfdvebzwli5unme

Generic Fully Simulatable Adaptive Oblivious Transfer

Kaoru KUROSAWA, Ryo NOJIMA, Le Trieu PHONG
2015 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, and DCR.  ...  We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions.  ...  Introduction Background Oblivious transfer (OT) with adaptive queries, or adaptive OT for short, was first examined by Naor and Pinkas in [27] , in which there are a sender and a receiver.  ... 
doi:10.1587/transfun.e98.a.232 fatcat:uzt7s5dlvbg57gmyqlrrgq3xzy

Generic Fully Simulatable Adaptive Oblivious Transfer [chapter]

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
2011 Lecture Notes in Computer Science  
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, and DCR.  ...  We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions.  ...  Introduction Background Oblivious transfer (OT) with adaptive queries, or adaptive OT for short, was first examined by Naor and Pinkas in [27] , in which there are a sender and a receiver.  ... 
doi:10.1007/978-3-642-21554-4_16 fatcat:vb7ct36awzb45hgmo7s34laxma

Oblivious Transfer with Fine Grained Access Control from Ciphertext Policy Attribute Based Encryption in the Standard Model

Xingbing Fu, Fagen Li, Shengke Zeng
2016 International Journal of Future Generation Communication and Networking  
In this work, an oblivious transfer with complex access control scheme that is constructed based on ciphertext policy attribute based encryption (CP-ABE) scheme is proposed.  ...  In this work, we combine expressive ciphertext policy attribute based encryption scheme with oblivious transfer scheme to achieve complex access control over the encrypted records of the database and users  ...  Fully Simulatable Oblivious Transfer We employ the fully simulatable adaptive oblivious transfer protocol due to Camenisch J. et.al.  ... 
doi:10.14257/ijfgcn.2016.9.1.25 fatcat:2yrn2atv2zh2nbq7ighipmscci

Round-Optimal Black-Box Two-Party Computation [chapter]

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro
2015 Lecture Notes in Computer Science  
We provide the first 4-round black-box oblivious transfer based on any enhanced trapdoor permutation.  ...  Plugging a parallel version of our oblivious transfer into the blackbox non-interactive secure computation protocol of [IKO + 11] we obtain the first round-optimal black-box two-party protocol in the plain  ...  Four-round Fully Simulatable Oblivious Transfer from Π R OT We transform the one-sided simulatable Π R OT into an OT which is simulatable for both the sender and the receiver using the following ingredients  ... 
doi:10.1007/978-3-662-48000-7_17 fatcat:txyvfmcx5zdevjdqolxk4ezbba

SHADE: Secure HAmming DistancE Computation from Oblivious Transfer [chapter]

Julien Bringer, Hervé Chabanne, Alain Patey
2013 Lecture Notes in Computer Science  
Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the malicious setting.  ...  Our second scheme achieves full security against malicious adversaries and is based on Committed Oblivious Transfer. These protocols have direct applications to secure biometric identification.  ...  The Fully Secure Scheme We use an adaptation of the OT-hybrid model to Committed Oblivious Transfer.  ... 
doi:10.1007/978-3-642-41320-9_11 fatcat:7jk5rkydafcpbnfwjztaq5dcau

Simulatable Adaptive Oblivious Transfer [chapter]

Jan Camenisch, Gregory Neven, abhi shelat
2007 Lecture Notes in Computer Science  
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that (a) the sender learns  ...  This second construction uses novel techniques for building efficient simulatable protocols.  ...  Finally, we observe that simulatable oblivious transfer is used as a primitive to build many other cryptographic protocols [Gol04] .  ... 
doi:10.1007/978-3-540-72540-4_33 fatcat:oeuomhzoavbchlazx3cljg7c3i

Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer [chapter]

Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou
2009 Lecture Notes in Computer Science  
Indeed, we showcase our methodology by applying it to the recent Oblivious Transfer protocol by Peikert et al.  ...  In particular, to transfer an nbit message, we use a constant number of rounds and O(n) public key operations.  ...  Taking Oblivious Transfer as an example, this indeed seems to be the case.  ... 
doi:10.1007/978-3-642-03356-8_30 fatcat:r6cuynclera67nj22acjec2n44

On Black-Box Complexity of Universally Composable Security in the CRS Model [chapter]

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2015 Lecture Notes in Computer Science  
Designing the first static UC secure oblivious transfer protocol based on public-key encryption and stand-alone semi-honest oblivious transfer.  ...  As a corollary we obtain the first black-box constructions of UC secure computation assuming only two-round semi-honest oblivious transfer. • One-sided UC secure computation.  ...  Next, we use the transformed oblivious transfer protocol in order to construct a maliciously fully secure oblivious transfer.  ... 
doi:10.1007/978-3-662-48800-3_8 fatcat:vlf6lt7nwvcqzmzmanaex6mava

Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation

Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
1998 Journal of Cryptology  
In OVY1 w e deal with oblivious transfer and any technique succeeding in allowing a weak sender there, would be quite signi cant since it would implement oblivious transfer between polynomial time parties  ...  De ne FU as the set of all y 2 I U and are fully balanced in U.  ... 
doi:10.1007/s001459900037 fatcat:w7gkgefv4bcblfckxckuwcigbu
« Previous Showing results 1 — 15 out of 289 results