Laconic Oblivious Transfer and Its Applications

Cho, Chongwon; Döttling, Nico; Garg, Sanjam; Gupta, Divya; Miao, Peihan; Polychroniadou, Antigoni

doi:10.1007/978-3-319-63715-0_2

Cited by 69 publications

(9 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, researches on ORAM are an inseparable part of oblivious transfer protocol which is a cryptographic primitive to conceal what pieces of information has been transferred. Though the scope of the research is different from this paper, Cho et al considers the location of message throughout their research in [12].…”

Section: Related Searchable Techniquesmentioning

confidence: 96%

Advanced Searchable Encryption: An Adaptively Secure Keyword Search for Matrix-type Storages

Kodera

Kuribayashi

Kusaka

et al. 2019

IJNC

View full text Add to dashboard Cite

IoT technologies and cloud storages have been developed remarkably, and many types of data including private information have been gradually outsourced. For such a situation, new convenient functionalities such as arithmetic and a keyword search over ciphertexts are required to allow users to obtain information without leaking queried results, contents of ciphertext, and so on. Especially, searchable encryptions have been paid much attention to realize a keyword search on an encrypted domain. In addition, an architecture of searchable symmetric encryption (SSE) is a suitable and efficient solution for data outsourcing. In this paper, we focus on an SSE scheme which employs a secure index for searching a keyword. In conventional studies, it has been widely considered that the scheme searches whether a queried keyword is contained in encrypted documents or not. On the other hand, we additionally take into account the location of the queried keyword in the documents by targeting a matrix-type data format. The method enables an administrator to search personal information listed per line or column in CSV-like format data.

show abstract

Section: Related Searchable Techniquesmentioning

confidence: 96%

Advanced Searchable Encryption: An Adaptively Secure Keyword Search for Matrix-type Storages

Kodera

Kuribayashi

Kusaka

et al. 2019

IJNC

View full text Add to dashboard Cite

show abstract

“…It differs from ORAM because in ORAM the sender is trusted while the receiver is not trusted. When used with elliptic curve cryptography, OT schemes are fast and scalable [15], [8].…”

Section: Related Workmentioning

confidence: 99%

FedORAM: A Federated Oblivious RAM Scheme

2020

View full text Add to dashboard Cite

Instant messaging (IM) applications, even with end-to-end encryption enabled, pose privacy issues due to metadata and pattern leakage. Our goal is to develop a model for a privacy preserving IM application, by designing an IM application that focuses on hiding metadata and discussion patterns. To solve the issue of privacy preservation through the obfuscation of metadata, cryptographic constructions like Oblivious Random Access Machines (ORAM) have been proposed in recent years. However, although they completely hide the user access patterns, they incur high computational costs, often resulting in excessively slow performance in practice. We propose a new federated model, FedORAM, which is the first ORAM scheme that uses a federation of servers to hide metadata for an IM use case. In order to investigate the tradeoff between security and performance, we propose two versions of FedORAM: Weak FedORAM and Strong FedORAM. Strong FedORAM uses a tree-based federation architecture to ensure strong obliviousness, but with an increased overhead cost. Weak FedORAM has a more simple federated architecture that only uses Oblivious Transfer (OT) to increase communication speed, but with security consequences. Our results show that both constructions are faster than a similar client-server ORAM scheme. Furthermore, Weak FedORAM has a response time of less than 2 seconds per message for a middle-sized federation.

show abstract

“…Nowadays, many applications are rapidly transferred to cloud-based service, and it would be desired to seek some server-aided OT extension protocol to relief the burden of S under reasonable security assumption. A considerable literature [6][7][8][9][10][11][12] has grown up around the theme of fertilizing functionality of OTor optimizing communication cost of the receiver R. However, far too little attention has been paid to investigate sender side of OT adapting to specific scenarios.…”

Section: Motivationmentioning

confidence: 99%

“…Lindell et al [11] studied input-size hiding two-party computation based on fully homomorphic encryption (FHE) and proposed a secure OT extension protocol to reduce the communication cost of both the sender and receiver. Cho et al [12] focused on the receivers' communication cost in OT and proposed laconic OT protocol based on the decisional Diffie-Hellman (DDH) assumption. Carter et al [30] proposed outsourced OT protocol specifically for the mobile use-case where the cloud receives outputs of OT.…”

Section: Related Work Rabinmentioning

confidence: 99%

An Efficient Outsourced Oblivious Transfer Extension Protocol and Its Applications

Zhao

Song

Han

et al. 2020

Security and Communication Networks

View full text Add to dashboard Cite

Oblivious transfer (OT) is a cryptographic primitive originally used to transfer a collection of messages from the sender to the receiver in an oblivious manner. OT extension protocol reduces expensive asymmetric operations by running a small number of OT instances first and then cheap symmetric operations. While most earlier works discussed security model or communication and computation complexity of OT in general case, we focus on concrete application scenarios, especially where the sender in the OT protocol is a database with less computation and limited interaction capability. In this paper, we propose a generic outsourced OT extension protocol ( O Tex ) that outsources all the asymmetric operations of the sender to a semihonest server so as to adapt to specific scenarios above. We give O Tex a standard security definition, and the proposed protocol is proven secure in the semihonest model. In O Tex , the sender works on the fly and performs only symmetric operations locally. Whatever the number of rounds OT to be executed and the length of messages in OT to be sent, our protocol realizes optimal complexity. Besides, O Tex can be used to construct high-level protocols, such as private membership test (PMT) and private set intersection (PSI). We believe our O Tex construction may be a building block in other applications as well.

show abstract

Laconic Oblivious Transfer and Its Applications

Cited by 69 publications

References 53 publications

Advanced Searchable Encryption: An Adaptively Secure Keyword Search for Matrix-type Storages

Advanced Searchable Encryption: An Adaptively Secure Keyword Search for Matrix-type Storages

FedORAM: A Federated Oblivious RAM Scheme

An Efficient Outsourced Oblivious Transfer Extension Protocol and Its Applications

Contact Info

Product

Resources

About