The following pages link to (Q3325625):
Displaying 50 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Concurrent signature without random oracles (Q476860) (← links)
- Quantum oblivious transfer with relaxed constraints on the receiver (Q496888) (← links)
- Quantum oblivious transfer: a secure practical implementation (Q513836) (← links)
- Optimal symmetric ternary quantum encryption schemes (Q517624) (← links)
- Secure collaborative supply chain planning and inverse optimization -- the JELS model (Q621669) (← links)
- Generalized oblivious transfer by secret sharing (Q629875) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- ``The simplest protocol for oblivious transfer'' revisited (Q783707) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Quantum cryptography (Q975385) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- Partitioned encryption and achieving simultaneity by partitioning (Q1099131) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- Privacy-preserving inverse distance weighted interpolation (Q1639853) (← links)
- Flexible quantum oblivious transfer (Q1705113) (← links)
- Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
- Oblivious keyword search (Q1827575) (← links)
- Practical and provably secure release of a secret and exchange of signatures (Q1903345) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Fair and optimistic contract signing based on quantum cryptography (Q2010992) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Practical quantum contract signing without quantum storage (Q2102277) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- SoK: communication across distributed ledgers (Q2147221) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Secure multi-party quantum private information query (Q2308401) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol (Q2353122) (← links)
- Secure quantum weak oblivious transfer against individual measurements (Q2355619) (← links)
- Enhancements of trapdoor permutations (Q2392094) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- Completeness for symmetric two-party functionalities: revisited (Q2413612) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes (Q2571970) (← links)
- Quantum public-key encryption schemes based on conjugate coding (Q2684295) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation (Q2817471) (← links)
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
