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

Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem

Claude Crépeau, Raza Ali Kazmi

Published Jan 1, 2015• 3 citations
Publisher
DOI
10.1007/978-3-662-48054-0_22

Related papers

General Public Key m-Out-of-n Oblivious Transfer

Zhide Chen, Hong Ping Zhu

Lecture notes in computer science•Jan 1, 2004•0 citations

Public-Randomness in Public-Key Cryptography

Alfredo De Santis, Giuseppe Persiano

Lecture notes in computer science•Jan 1, 1991•16 citations

Cryptography from post-quantum assumptions

Raza Ali Kazmi

In this thesis we present our contribution in the field of post-quantum cryptography. We introduce a new notion of weakly Random-Self-Reducible public-key cryptosystem and show how it can be used to implement secure Oblivious Transfer. We also show that two recent (Post-quantum) cryptosystems can be considered as weakly Random-Self-Reducible. We introduce a new problem called Isometric Lattice Problem and reduce graph isomorphism and linear code equivalence to this problem. We also show that this problem has a perfect zero-knowledge interactive proof with respect to a malicious verifier; this is the only hard problem in lattices that is known to have this property.

•Jan 1, 2015•4 citations

A Randomized Protocol for Signing Contracts

Shimon Even, Oded Goldreich, Abraham Lempel

Randomized protocols for signing contracts, certified mail, and flipping a coin are presented. The protocols use a 1-out-of-2 oblivious transfer subprotocol which is axiomatically defined. The 1-out-of-2 oblivious transfer allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart. The first (second) secret is received with probability one half, while the sender is ignorant of which secret has been received. An implementation of the 1-out-of-2 oblivious transfer, using any public key cryptosystem, is presented.

Springer eBooks•Jan 1, 1983•1,446 citations

Effective Oblivious Transfer Using a Probabilistic Encryption

Alexander Frolov

Advances in intelligent and soft computing•Jul 11, 2012•1 citation

Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption

Isheeta Nargis

Lecture notes in computer science•Jan 1, 2017•2 citations
In this thesis we present our contribution in the field of post-quantum cryptography. We introduce a new notion of weakly Random-Self-Reducible public-key cryptosystem and show how it can be used to implement secure Oblivious Transfer. We also show that two recent (Post-quantum) cryptosystems can be considered as weakly Random-Self-Reducible. We introduce a new problem called Isometric Lattice Problem and reduce graph isomorphism and linear code equivalence to this problem. We also show that this problem has a perfect zero-knowledge interactive proof with respect to a malicious verifier; this is the only hard problem in lattices that is known to have this property.
Randomized protocols for signing contracts, certified mail, and flipping a coin are presented. The protocols use a 1-out-of-2 oblivious transfer subprotocol which is axiomatically defined. The 1-out-of-2 oblivious transfer allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart. The first (second) secret is received with probability one half, while the sender is ignorant of which secret has been received. An implementation of the 1-out-of-2 oblivious transfer, using any public key cryptosystem, is presented.