Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems

Huafei Zhu, Feng Bao

Published Jan 1, 2009• 4 citations
Publisher
DOI
10.1007/978-3-642-10628-6_27

Related papers

A Variant of Naor-Pinkas Oblivious Transfer for More Efficient Authentication

Yongsoo Hwang, Hyochul Chae, Moongu Jeon

Communications in computer and information science•Jan 1, 2010•0 citations

Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer

Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou

Lecture notes in computer science•Jan 1, 2009•54 citations

Two Kinds of Method to Construct Oblivious Transfer Protocols

Huang Gen-xun

As a fundamental cryptology protocol,oblivious transfer is applied abroad in practice.The methods to construct the protocol are divided into two kinds,direct and indirect.With the help of idea of the representation of integer in base t and the DDH assumption,it proposes a kind of indirect method to construct the protocol with lower computation complexity based on Naor-Pinkas′s scheme,moreover,another kind of direct method is put forward in terms of the some public cryptosystems with homomorphism.

Modern Electronics Technique•Jan 1, 2007•0 citations

Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

Ivan Damgård, Jesper Buus Nielsen

Lecture notes in computer science•Jan 1, 2000•177 citations

Optimal-Rate Non-Committing Encryption

Ran Canetti, Oxana Poburinnaya, Mariana Raykova

Lecture notes in computer science•Jan 1, 2017•11 citations

On insecurity of Naor–Pinkas' distributed oblivious transfer

Hossein Ghodosi

Information Processing Letters•Jun 23, 2007•4 citations
As a fundamental cryptology protocol,oblivious transfer is applied abroad in practice.The methods to construct the protocol are divided into two kinds,direct and indirect.With the help of idea of the representation of integer in base t and the DDH assumption,it proposes a kind of indirect method to construct the protocol with lower computation complexity based on Naor-Pinkas′s scheme,moreover,another kind of direct method is put forward in terms of the some public cryptosystems with homomorphism.