scientific article; zbMATH DE number 3856987
From MaRDI portal
Publication:3325625
Recommendations
Cited in
(only showing first 100 items - show all)- Private multiparty sampling and approximation of vector combinations
- Analyzing security protocols using time-bounded task-PIOAs
- Transaction protection by beacons
- Partitioned encryption and achieving simultaneity by partitioning
- Protecting data privacy in private information retrieval schemes
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
- Privacy-preserving inverse distance weighted interpolation
- Flexible quantum oblivious transfer
- Efficient and secure outsourced approximate pattern matching protocol
- On the efficiency of multi-party contract signing protocols
- Oblivious keyword search
- Practical and provably secure release of a secret and exchange of signatures
- Mathematical problems in cryptology
- Fair and optimistic contract signing based on quantum cryptography
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- Practical quantum contract signing without quantum storage
- Computational hardness of optimal fair computation: beyond Minicrypt
- SoK: communication across distributed ledgers
- Modular verification of protocol equivalence in the presence of randomness
- Batch-OT with optimal rate
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Privacy-enhanced attribute-based private information retrieval
- Secure multi-party quantum private information query
- On black-box complexity of universally composable security in the CRS model
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol
- Secure quantum weak oblivious transfer against individual measurements
- Enhancements of trapdoor permutations
- Private set intersection: new generic constructions and feasibility results
- More efficient oblivious transfer extensions
- Completeness for symmetric two-party functionalities: revisited
- On the feasibility of extending oblivious transfer
- Two provably secure k-out-of-n oblivious transfer schemes
- Quantum public-key encryption schemes based on conjugate coding
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- On actively-secure elementary MPC reductions
- On communication models and best-achievable security in two-round MPC
- Oblivious transfer from trapdoor permutations in minimal rounds
- Amortizing rate-1 OT and applications to PIR and PSI
- Accelerating oblivious transfer with batch multi-exponentiation
- Adaptive hardness and composable security in the plain model from standard assumptions
- High-precision secure computation of satellite collision probabilities
- What Security Can We Achieve Within 4 Rounds?
- Network oblivious transfer
- On the Power of Secure Two-Party Computation
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Deciding strategy properties of contract-signing protocols
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Secret-Sharing Schemes: A Survey
- Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
- Weak oblivious transfer from strong one-way functions
- Bit commitment in the bounded storage model: tight bound and simple optimal construction
- On complete primitives for fairness
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Twot-out-of-n oblivious transfer schemes with designated receiver
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
- Oblivious Transfer Is Symmetric
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- Universally Composable Adaptive Oblivious Transfer
- Adaptively Secure Two-Party Computation with Erasures
- Strengthening the Security of Distributed Oblivious Transfer
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- Communication-efficient distributed oblivious transfer
- Concurrent signature without random oracles
- Quantum oblivious transfer with relaxed constraints on the receiver
- Necessity of parameter randomization in quantum contract signing
- A simple protocol for signing contracts
- Reducibility among protocols. (Extended abstract)
- How to simulate it -- a tutorial on the simulation proof technique
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Quantum oblivious transfer: a secure practical implementation
- Cryptography and cryptographic protocols
- Optimal symmetric ternary quantum encryption schemes
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Breaking the sub-exponential barrier in obfustopia
- An improved non-repudiation protocol and its security analysis
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Alternative Protocols for Generalized Oblivious Transfer
- Oblivious Transfer Based on the McEliece Assumptions
- Round Optimal Universally Composable Oblivious Transfer Protocols
- Formal abstractions for attested execution secure processors
- Simple and generic constructions of succinct functional encryption
- Algebraic restriction codes and their applications
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- Statistically sender-private OT from LPN and derandomization
- A new framework for quantum oblivious transfer
- Best of both worlds. Revisiting the spymasters double agent problem
- Secure collaborative supply chain planning and inverse optimization -- the JELS model
- Generalized oblivious transfer by secret sharing
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- Non-interactive blind signatures from RSA assumption and more
- LR-OT: leakage-resilient oblivious transfer
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- A poisoning-resilient LDP schema leveraging oblivious transfer with the Hadamard transform
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 Q3325625)
