Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428116
DOI10.1007/b11817zbMath1122.94422OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428116
Erez Petrank, Kobbi Nissim, Joe Kilian, Yuval Ishai
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Related Items
An Efficient Protocol for Oblivious DFA Evaluation and Applications ⋮ Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ On the round complexity of black-box secure MPC ⋮ Oblivious key-value stores and amplification for private set intersection ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Two-round MPC: information-theoretic and black-box ⋮ Information-theoretic broadcast with dishonest majority for long messages ⋮ Best possible information-theoretic MPC ⋮ Practical attacks against the walnut digital signature scheme ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Garbling XOR gates ``for free in the standard model ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Round-optimal black-box protocol compilers ⋮ Batch-OT with optimal rate ⋮ Reusable Two-Round MPC from LPN ⋮ More efficient oblivious transfer extensions ⋮ On the feasibility of extending oblivious transfer ⋮ Fast garbling of circuits under standard assumptions ⋮ The Simplest Protocol for Oblivious Transfer ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Efficient and scalable universal circuits ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ Structure-aware private set intersection, with applications to fuzzy matching ⋮ High-throughput secure three-party computation with an honest majority ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Adaptively code-correlation robustness functions and its applications to private set intersection ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Oblivious transfer with constant computational overhead ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ Better security-efficiency trade-offs in permutation-based two-party computation ⋮ Batching base oblivious transfers ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ A new framework for quantum oblivious transfer ⋮ A framework for statistically sender private OT with optimal rate ⋮ Malicious secure, structure-aware private set intersection ⋮ Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Secret-shared shuffle ⋮ Oblivious pseudorandom functions from isogenies ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free ⋮ Secure two-party computation in a quantum world ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ All-but-many encryption ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Improved Private Set Intersection Against Malicious Adversaries ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Oblivious DFA evaluation on joint input and its applications ⋮ Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer ⋮ OT-Combiners via Secure Computation ⋮ On the Correlation Intractability of Obfuscated Pseudorandom Functions ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ SPEED: secure, private, and efficient deep learning ⋮ Blazing fast OT for three-round UC OT extension ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Oblivious transfer is in MiniQCrypt ⋮ VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Private set operations from oblivious switching ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ Network Oblivious Transfer ⋮ Actively secure setup for SPDZ ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens ⋮ SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ PSI-stats: private set intersection protocols supporting secure statistical functions ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Private set intersection in the internet setting from lightweight oblivious PRF ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Hashing Garbled Circuits for Free ⋮ PSI from PaXoS: fast, malicious private set intersection
