A Framework for Efficient and Composable Oblivious Transfer

DOI10.1007/978-3-540-85174-5_31zbMath1183.94046OpenAlexW2167236842MaRDI QIDQ3600240

Chris Peikert, Vinod Vaikuntanathan, Brent Waters

Publication date: 10 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_31

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (only showing first 100 items - show all)

Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption ⋮ Round-Optimal Black-Box Two-Party Computation ⋮ Actively Secure OT Extension with Optimal Overhead ⋮ Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Credibility in private set membership ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Oblivious message retrieval ⋮ Succinct classical verification of quantum computation ⋮ Password-authenticated key exchange from group actions ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ How to compress encrypted data ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ A new framework for quantum oblivious transfer ⋮ Quantum search-to-decision reduction for the LWE problem ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ On concurrent multi-party quantum computation ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Packed Ciphertexts in LWE-Based Homomorphic Encryption ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions ⋮ Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems ⋮ Public-Key Encryption Schemes with Auxiliary Inputs ⋮ Public-Key Cryptographic Primitives Provably as Secure as Subset Sum ⋮ Round Optimal Universally Composable Oblivious Transfer Protocols ⋮ How to Simulate It – A Tutorial on the Simulation Proof Technique ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ On the round complexity of secure quantum computation ⋮ Lattice-based key exchange on small integer solution problem ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Polly cracker, revisited ⋮ Two-round MPC: information-theoretic and black-box ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Two-message statistically sender-private OT from LWE ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Survey of information security ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ An improved affine equivalence algorithm for random permutations ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Fully leakage-resilient signatures ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Round-optimal black-box protocol compilers ⋮ Asymptotically quasi-optimal cryptography ⋮ Secure multiparty computation with free branching ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Lattice trapdoors and IBE from middle-product LWE ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ From FE combiners to secure MPC and back ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Compressible FHE with applications to PIR ⋮ More efficient oblivious transfer extensions ⋮ Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem ⋮ The Simplest Protocol for Oblivious Transfer ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Generalizing Efficient Multiparty Computation ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Cryptographic group actions and applications ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based

This page was built for publication: A Framework for Efficient and Composable Oblivious Transfer