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 ApplicationsSecure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line MarketplacesOn the round complexity of black-box secure MPCOblivious key-value stores and amplification for private set intersectionSilver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codesAutomata evaluation and text search protocols with simulation-based securityFast cut-and-choose-based protocols for malicious and covert adversariesTwo-round MPC: information-theoretic and black-boxInformation-theoretic broadcast with dishonest majority for long messagesBest possible information-theoretic MPCPractical attacks against the walnut digital signature schemeMPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applicationsGarbling XOR gates ``for free in the standard modelBinary AMD Circuits from Secure Multiparty ComputationSecure Multiparty RAM Computation in Constant RoundsFull-threshold actively-secure multiparty arithmetic circuit garblingFiat-Shamir and correlation intractability from strong KDM-secure encryptionOptimal extension protocols for Byzantine broadcast and agreementRound-optimal black-box protocol compilersBatch-OT with optimal rateReusable Two-Round MPC from LPNMore efficient oblivious transfer extensionsOn the feasibility of extending oblivious transferFast garbling of circuits under standard assumptionsThe Simplest Protocol for Oblivious TransferA Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of EquationsActively secure arithmetic computation and VOLE with constant computational overheadEfficient and scalable universal circuitsRai-Choo! Evolving blind signatures to the next levelStructure-aware private set intersection, with applications to fuzzy matchingHigh-throughput secure three-party computation with an honest majority(Efficient) universally composable oblivious transfer using a minimal number of stateless tokensRound-optimal black-box secure computation from two-round malicious OTAdaptively code-correlation robustness functions and its applications to private set intersectionAttaining GOD beyond honest majority with friends and foesReverse firewalls for oblivious transfer extension and applications to zero-knowledgeOblivious transfer with constant computational overheadEfficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication costTwo-round MPC without round collapsing revisited -- towards efficient malicious protocolsSoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt modelGarbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluationBetter security-efficiency trade-offs in permutation-based two-party computationBatching base oblivious transfersCorrelated pseudorandomness from expand-accumulate codesHalf-tree: halving the cost of tree expansion in COT and DPFA new framework for quantum oblivious transferA framework for statistically sender private OT with optimal rateMalicious secure, structure-aware private set intersectionTwo-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functionsCorrelated pseudorandomness from the hardness of quasi-abelian decoding\texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplicationEfficient and round-optimal oblivious transfer and commitment with adaptive securitySecret-shared shuffleOblivious pseudorandom functions from isogeniesImproved Garbled Circuit: Free XOR Gates and ApplicationsOn derandomizing Yao's weak-to-strong OWF constructionAmortizing rate-1 OT and applications to PIR and PSIActively Secure 1-out-of-N OT Extension with Application to Private Set IntersectionFree IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for freeSecure two-party computation in a quantum worldEfficient, actively secure MPC with a dishonest majority: a surveyAll-but-many encryptionTinyKeys: a new approach to efficient multi-party computationActively secure garbled circuits with constant communication overhead in the plain modelImproved Private Set Intersection Against Malicious AdversariesSecurity against covert adversaries: Efficient protocols for realistic adversariesOblivious DFA evaluation on joint input and its applicationsSecure extended wildcard pattern matching protocol from cut-and-choose oblivious transferOT-Combiners via Secure ComputationOn the Correlation Intractability of Obfuscated Pseudorandom FunctionsOn the Complexity of Additively Homomorphic UC CommitmentsSecure computation of the median (and other elements of specified ranks)Efficient and secure outsourced approximate pattern matching protocolHigh-performance multi-party computation for binary circuits based on oblivious transferComputationally secure pattern matching in the presence of malicious adversariesSPEED: secure, private, and efficient deep learningBlazing fast OT for three-round UC OT extensionThe rise of Paillier: homomorphic secret sharing and public-key silent OTOblivious transfer is in MiniQCryptVOLE-PSI: fast OPRF and circuit-PSI from vector-OLEMasked triples. Amortizing multiplication triples across conditionalsPrivate set operations from oblivious switchingHigh-Precision Secure Computation of Satellite Collision ProbabilitiesNetwork Oblivious TransferActively secure setup for SPDZTruly Efficient String Oblivious Transfer Using Resettable Tamper-Proof TokensSecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient UpdatesEfficient constant-round MPC with identifiable abort and public verifiabilityBlack-box transformations from passive to covert security with public verifiabilityStacked garbling. Garbled circuit proportional to longest execution pathImproved primitives for MPC over mixed arithmetic-binary circuitsPSI-stats: private set intersection protocols supporting secure statistical functionsEfficient oblivious evaluation protocol and conditional disclosure of secrets for DFAEfficient and tight oblivious transfer from PKE with tight multi-user securityPrivate set intersection in the internet setting from lightweight oblivious PRFNon-interactive Secure 2PC in the Offline/Online and Batch SettingsHashing Garbled Circuits for FreePSI from PaXoS: fast, malicious private set intersection