Constant-Round Multi-Party Private Set Union Using Reversed Laurent Series

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-30057-8_24
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Private Web Search With Constant Round Efficiency

2015English

Byzantine Set-Union Consensus Using Efficient Set Reconciliation

Eurasip Journal on Information Security
Computer Science ApplicationsSignal Processing
2017English

Representative Based Multi-Round Protocol Based on Revealed Private Information for Multi-Issue Negotiations

Multiagent and Grid Systems
Computer Science
2010English

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Constant Round Dynamic Group Key Agreement

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Achieving Constant Round Leakage-Resilient Zero-Knowledge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Efficient Private Multi-Party Computations of Trust in the Presence of Curious and Malicious Users

Journal of Trust Management
2014English

Structural Optimization of Variational Inequalities Using Piecewise Constant Level Set Method

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2013English

The Communist Party of the Soviet Union

Russian Review
LinguisticsLiteratureLanguageSociologyLiterary TheoryCultural StudiesPolitical ScienceHistory
1970English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy