scientific article; zbMATH DE number 4191102
From MaRDI portal
Publication:3210162
Recommendations
Cited in
(39)- Translucent cryptography -- an alternative to key escrow, and its implementation via fractional oblivious transfer
- Two-round MPC: information-theoretic and black-box
- Two-message statistically sender-private OT from LWE
- Laconic oblivious transfer and its applications
- Flexible quantum oblivious transfer
- Oblivious keyword search
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Two-round oblivious transfer from CDH or LPN
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Existence of 3-round zero-knowledge proof systems for NP
- Oblivious polynomial evaluation and oblivious neural learning
- On the exact round complexity of best-of-both-worlds multi-party computation
- Acyclicity programming for sigma-protocols
- Accelerating oblivious transfer with batch multi-exponentiation
- A Game-Theoretic Perspective on Oblivious Transfer
- The simplest protocol for oblivious transfer
- Oblivious transfers and intersecting codes
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Improved Garbled Circuit: Free XOR Gates and Applications
- Communication-efficient distributed oblivious transfer
- Decentralized anonymous micropayments
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Oblivious Transfer Based on the McEliece Assumptions
- Non-interactive Mimblewimble transactions, revisited
- Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
- Endemic oblivious transfer via random oracles, revisited
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- Towards topology-hiding computation from oblivious transfer
- Fast public-key silent OT and more from constrained Naor-Reingold
- Non-interactive blind signatures from RSA assumption and more
- On the relationship between public key primitives via indifferentiability
- Non-interactive distributed point functions
- Simple two-message OT in the explicit isogeny model
- The round complexity of proofs in the bounded quantum storage model
- Tighter concrete security for the simplest OT
- An asymmetric Diffie-Hellman protocol with enhanced efficiency through parallelization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210162)
