Secure Computation of Private Set Intersection Cardinality With Linear Complexity

Advances in Information Security, Privacy, and Ethics
doi 10.4018/978-1-5225-5742-5.ch006
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IGI Global

Related search

Efficient Private Matching and Set Intersection

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Near-Linear Unconditionally-Secure Multiparty Computation With a Dishonest Minority

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

The Communication Complexity of Set Intersection and Multiple Equality Testing

2020English

Verifiable Secure Computation of Linear Fractional Programming Using Certificate Validation

International Journal of Power Electronics and Drive Systems
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2020English

Secure Computation

English

Parameterized Complexity of Cardinality Constrained Optimization Problems

Computer Journal
Computer Science
2007English

Outsourcing Set Intersection Computation Based on Bloom Filter for Privacy Preservation in Multimedia Processing

Security and Communication Networks
Computer NetworksInformation SystemsCommunications
2018English

Secure Computation Without Authentication

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy