scientific article
From MaRDI portal
Publication:2778845
zbMath0981.94042MaRDI QIDQ2778845
Bill Aiello, Yuval Ishai, Omer Reingold
Publication date: 21 March 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2045/20450119
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Efficient set intersection with simulation-based security ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Quadratic secret sharing and conditional disclosure of secrets ⋮ Selling multiple secrets to a single buyer ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ UC Updatable Databases and Applications ⋮ Two-message statistically sender-private OT from LWE ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Asymptotically quasi-optimal cryptography ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ UC priced oblivious transfer with purchase statistics and dynamic pricing ⋮ On the feasibility of extending oblivious transfer ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Algebraic restriction codes and their applications ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Oblivious Keyword Search with Authorization ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Solutions to the anti-piracy problem in oblivious transfer ⋮ Fully-Simulatable Oblivious Set Transfer ⋮ Efficient Traceable Oblivious Transfer and Its Applications ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Smooth projective hashing and two-message oblivious transfer ⋮ Generalized oblivious transfer by secret sharing ⋮ A new framework for quantum oblivious transfer ⋮ 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 ⋮ Individual simulations ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Communication-efficient distributed oblivious transfer ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ Efficient oblivious transfers with access control ⋮ Restricted adaptive oblivious transfer ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Secure two-party computation in a quantum world ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Circuit-Private Multi-key FHE ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Towards Robust Computation on Encrypted Data ⋮ Unnamed Item ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ Alternative Protocols for Generalized Oblivious Transfer ⋮ The communication complexity of private simultaneous messages, revisited ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ Oblivious signature-based envelope ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ Communication-Efficient Private Protocols for Longest Common Subsequence ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ Universally Composable Adaptive Priced Oblivious Transfer ⋮ On the Existence of Extractable One-Way Functions ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ Two-round oblivious transfer from CDH or LPN
