scientific article
From MaRDI portal
Publication:2768332
zbMath0991.94045MaRDI QIDQ2768332
Publication date: 1 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (89)
Efficient set intersection with simulation-based security ⋮ An Efficient Protocol for Oblivious DFA Evaluation and Applications ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Two-message statistically sender-private OT from LWE ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ An improved affine equivalence algorithm for random permutations ⋮ 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 ⋮ More efficient oblivious transfer extensions ⋮ Randomized quantum oblivious transfer with application in hacker-resistant computation ⋮ The Simplest Protocol for Oblivious Transfer ⋮ How to simulate it in Isabelle: towards formal proof for secure multi-party computation ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Algebraic restriction codes and their applications ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Statistical security in two-party computation revisited ⋮ 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 ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Batching base oblivious transfers ⋮ Faster Privacy-Preserving Location Proximity Schemes ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Smooth projective hashing and two-message oblivious transfer ⋮ A new framework for quantum oblivious transfer ⋮ Round-optimal black-box MPC in the plain model ⋮ Reusable secure computation 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 ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Cryptographic group actions and applications ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Flexible quantum oblivious transfer ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Communication-efficient distributed oblivious transfer ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Secure two-party computation in a quantum world ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Improved Private Set Intersection Against Malicious Adversaries ⋮ What security can we achieve within 4 rounds? ⋮ Oblivious DFA evaluation on joint input and its applications ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Statistical ZAP arguments ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Compact, efficient and UC-secure isogeny-based oblivious transfer ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions ⋮ Robust non-interactivet-out-of-noblivious transfer based on the RSA cryptosystem ⋮ Weak Oblivious Transfer from Strong One-Way Functions ⋮ BETA: biometric-enabled threshold authentication ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ Network Oblivious Transfer ⋮ On the Existence of Extractable One-Way Functions ⋮ Spooky Encryption and Its Applications ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Oblivious keyword search ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Secure linear system computation in the presence of malicious adversaries ⋮ SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ Succinct non-interactive secure computation ⋮ PSI from PaXoS: fast, malicious private set intersection ⋮ Two-round oblivious transfer from CDH or LPN
This page was built for publication:
