Two-message statistically sender-private OT from LWE

DOI10.1007/978-3-030-03810-6_14zbMath1430.94060OpenAlexW2898733944MaRDI QIDQ1631337

Nico Döttling, Zvika Brakerski

Publication date: 6 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (38)

Compact ring signatures from learning with errors ⋮ Multi-theorem designated-verifier NIZK for QMA ⋮ Asymptotically quasi-optimal cryptography ⋮ Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Algebraic restriction codes and their applications ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Statistical security in two-party computation revisited ⋮ mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Concurrently composable non-interactive secure computation ⋮ 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 ⋮ Round-optimal black-box MPC in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ A framework for statistically sender private OT with optimal rate ⋮ On concurrent multi-party quantum computation ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Secure quantum computation with classical communication ⋮ The round complexity of quantum zero-knowledge ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Secure two-party computation in a quantum world ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ A framework for cryptographic problems from linear algebra ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Statistical ZAP arguments ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ Succinct non-interactive secure computation ⋮ Two-round oblivious transfer from CDH or LPN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• New bounds in some transference theorems in the geometry of numbers
• Definitions and properties of zero-knowledge proof systems
• Statistical witness indistinguishability (and more) in two messages
• Distinguisher-dependent simulation in two rounds and its applications
• Four round secure computation without setup
• Round optimal concurrent MPC via strong simulation
• Round optimal concurrent non-malleability from polynomial hardness
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Promise zero knowledge and its applications to round optimal MPC
• Nash on game theory applications
• Maliciously Circuit-Private FHE
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• A Framework for Efficient and Composable Oblivious Transfer
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Pseudorandomness of ring-LWE for any ring and modulus
• Public-key cryptosystems from the worst-case shortest vector problem
• Advances in Cryptology - EUROCRYPT 2004
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Round-optimal secure multi-party computation

This page was built for publication: Two-message statistically sender-private OT from LWE