Pages that link to "Item:Q5261671"

The following pages link to Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs (Q5261671):

Displaying 14 items.

• Quantum identity authentication scheme of vehicular ad-hoc networks (Q1740934) (← links)
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
• Private set-intersection with common set-up (Q1783703) (← links)
• Quantum secure two-party computation for set intersection with rational players (Q1993844) (← links)
• Secure and efficient multiparty private set intersection cardinality (Q2025374) (← links)
• Dynamic universal accumulator with batch update over bilinear groups (Q2152172) (← links)
• Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
• Bounded Size-Hiding Private Set Intersection (Q2827733) (← links)
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
• Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter (Q2980879) (← links)
• New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness (Q2988351) (← links)
• Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters (Q3194620) (← links)
• Multilinear Pseudorandom Functions (Q3448796) (← links)
• Scalable Multi-party Private Set-Intersection (Q5738787) (← links)