Pages that link to "Item:Q2819551"
From MaRDI portal
The following pages link to Oblivious transfer and polynomial evaluation (Q2819551):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Efficient oblivious transfers with access control (Q453798) (← links)
- A note on ``Selling multiple secrets to a single buyer'' (Q506371) (← links)
- Generalized oblivious transfer by secret sharing (Q629875) (← links)
- Application of blind quantum computation to two-party quantum computation (Q726068) (← links)
- Solutions to the anti-piracy problem in oblivious transfer (Q899580) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Comments on the `\(m\) out of \(n\) oblivious transfer' (Q1045921) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Privacy-preserving inverse distance weighted interpolation (Q1639853) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Computationally secure oblivious transfer (Q1777283) (← links)
- Oblivious keyword search (Q1827575) (← links)
- Finite interval-time transition system for real-time actors (Q1997268) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Private set intersection in the internet setting from lightweight oblivious PRF (Q2102052) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Oblivious key-value stores and amplification for private set intersection (Q2128570) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic (Q2500832) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Oblivious polynomial evaluation and oblivious neural learning (Q2566001) (← links)
- Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes (Q2571970) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection (Q2975818) (← links)
- Oblivious transfers and intersecting codes (Q3129464) (← links)
- Multiparty Proximity Testing with Dishonest Majority from Equality Testing (Q3167042) (← links)
- Efficient Disjointness Tests for Private Datasets (Q3511159) (← links)
- Oblivious Transfer Is Symmetric (Q3593098) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- A Highly Scalable RFID Authentication Protocol (Q3634505) (← links)
- Reducing elliptic curve logarithms to logarithms in a finite field (Q4307376) (← links)
- (Q4474185) (← links)
- Information Security and Privacy (Q5315291) (← links)
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer (Q5387104) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- Augmented Oblivious Polynomial Evaluation Protocol and Its Applications (Q5862667) (← links)
- Finding smooth integers in short intervals using CRT decoding (Q5894822) (← links)
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)
- Quantum oblivious transfer based on entanglement swapping (Q6049640) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme (Q6163697) (← links)
- Distributed protocols for oblivious transfer and polynomial evaluation (Q6623347) (← links)
- New proof systems and an OPRF from CSIDH (Q6635825) (← links)
