Smooth projective hashing and two-message oblivious transfer
From MaRDI portal
Publication:421036
DOI10.1007/s00145-010-9092-8zbMath1272.94033OpenAlexW1979280691MaRDI QIDQ421036
Shai Halevi, Yael Tauman Kalai
Publication date: 23 May 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-010-9092-8
Related Items
Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Two-message statistically sender-private OT from LWE ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ An improved affine equivalence algorithm for random permutations ⋮ A New General Framework for Secure Public Key Encryption with Keyword Search ⋮ Strong authenticated key exchange with auxiliary inputs ⋮ Algebraic restriction codes and their applications ⋮ Statistical security in two-party computation revisited ⋮ Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Statistically sender-private OT from LPN and derandomization ⋮ A new framework for quantum oblivious transfer ⋮ Round-optimal black-box MPC in the plain model ⋮ A framework for statistically sender private OT with optimal rate ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Cryptographic group actions and applications ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Revisited Experimental Comparison of Node-Link and Matrix Representations ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Cryptography Using Captcha Puzzles ⋮ Circuit-Private Multi-key FHE ⋮ What security can we achieve within 4 rounds? ⋮ One-Round Strong Oblivious Signature-Based Envelope ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Statistical ZAP arguments ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ BETA: biometric-enabled threshold authentication ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ On the Existence of Extractable One-Way Functions ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Public key encryption with equality test via hash proof system ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ The price of active security in cryptographic protocols ⋮ Succinct non-interactive secure computation ⋮ Two-round oblivious transfer from CDH or LPN
Cites Work
- Probabilistic encryption
- Efficient commitment schemes with bounded sender and unbounded receiver
- Randomness is linear in space
- Efficient and secure authenticated key exchange using weak passwords
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Universally Composable Password-Based Key Exchange
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Smooth projective hashing and two-message oblivious transfer
