Secure and Privacy-Preserving Consensus

Consensus is fundamental for distributed systems since it underpins key functionalities of such systems ranging from distributed information fusion, decision making, to decentralized control. In order to reach an agreement, existing consensus algorithms require each agent to exchange explicit state...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 64; číslo 10; s. 4035 - 4049
Hlavní autori:	Ruan, Minghao, Gao, Huan, Wang, Yongqiang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.10.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Computer networks Computer simulation Consensus Convergence Cryptography Data integration Decentralized control Decision making digital signature Encryption Exchanging Microcontrollers Multisensor fusion Nodes partial homomorphic cryptography Privacy privacy preservation Protocols Quantization (signal) security Topology
ISSN:	0018-9286, 1558-2523
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	Consensus is fundamental for distributed systems since it underpins key functionalities of such systems ranging from distributed information fusion, decision making, to decentralized control. In order to reach an agreement, existing consensus algorithms require each agent to exchange explicit state information with its neighbors. This leads to the disclosure of private state information, which is undesirable in cases where privacy is of concern. In this paper, we propose a novel approach for undirected networks, which can enable secure and privacy-preserving average consensus in a decentralized architecture in the absence of an aggregator or third party. By leveraging partial homomorphic cryptography to embed secrecy in pairwise interaction dynamics, our approach can guarantee convergence to the consensus value (subject to a quantization error) in a deterministic manner without disclosing a node's state to its neighbors. We provide a new privacy definition for dynamical systems, and give a new framework to rigorously prove that a node's privacy can be protected as long as it has at least one legitimate neighbor, which follows the consensus protocol faithfully without attempts to infer other nodes' states. In addition to enabling resilience to passive attackers aiming to steal state information, the approach also allows easy incorporation of defending mechanisms against active attackers who try to alter the content of exchanged messages. Furthermore, in contrast to existing noise-injection-based privacy-preserving mechanisms that have to reconfigure the entire network when the topology or number of nodes varies, our approach is applicable to dynamic environments with time-varying coupling topologies. This secure and privacy-preserving approach is also applicable to weighted average consensus as well as maximum/minimum consensus under a new update rule. Numerical simulations and comparison with existing approaches confirm the theoretical results. Experimental results on a Raspberry-Pi board based microcontroller network are also presented to verify the effectiveness and efficiency of the approach.
AbstractList	Consensus is fundamental for distributed systems since it underpins key functionalities of such systems ranging from distributed information fusion, decision making, to decentralized control. In order to reach an agreement, existing consensus algorithms require each agent to exchange explicit state information with its neighbors. This leads to the disclosure of private state information, which is undesirable in cases where privacy is of concern. In this paper, we propose a novel approach for undirected networks, which can enable secure and privacy-preserving average consensus in a decentralized architecture in the absence of an aggregator or third party. By leveraging partial homomorphic cryptography to embed secrecy in pairwise interaction dynamics, our approach can guarantee convergence to the consensus value (subject to a quantization error) in a deterministic manner without disclosing a node's state to its neighbors. We provide a new privacy definition for dynamical systems, and give a new framework to rigorously prove that a node's privacy can be protected as long as it has at least one legitimate neighbor, which follows the consensus protocol faithfully without attempts to infer other nodes’ states. In addition to enabling resilience to passive attackers aiming to steal state information, the approach also allows easy incorporation of defending mechanisms against active attackers who try to alter the content of exchanged messages. Furthermore, in contrast to existing noise-injection-based privacy-preserving mechanisms that have to reconfigure the entire network when the topology or number of nodes varies, our approach is applicable to dynamic environments with time-varying coupling topologies. This secure and privacy-preserving approach is also applicable to weighted average consensus as well as maximum/minimum consensus under a new update rule. Numerical simulations and comparison with existing approaches confirm the theoretical results. Experimental results on a Raspberry-Pi board based microcontroller network are also presented to verify the effectiveness and efficiency of the approach.
Author	Gao, Huan Wang, Yongqiang Ruan, Minghao
Author_xml	– sequence: 1 givenname: Minghao orcidid: 0000-0001-6778-7838 surname: Ruan fullname: Ruan, Minghao email: mruan@clemson.edu organization: Department of Electrical and Computer Engineering, Clemson University, Clemson, SC, USA – sequence: 2 givenname: Huan orcidid: 0000-0003-1911-2005 surname: Gao fullname: Gao, Huan email: hgao2@clemson.edu organization: Department of Electrical and Computer Engineering, Clemson University, Clemson, SC, USA – sequence: 3 givenname: Yongqiang orcidid: 0000-0002-8600-0276 surname: Wang fullname: Wang, Yongqiang email: yongqiw@clemson.edu organization: Department of Electrical and Computer Engineering, Clemson University, Clemson, SC, USA
BookMark	eNp9kE1LAzEURYNUsK3uBTcFF66m5uXzzbIMVoWCBes6ZDKpTKmZmswU-u-d0uLChavHg3vuhTMig9AET8gt0CkAzR9Xs2LKKORThjlF1BdkCFJixiTjAzKkFDDLGaorMkpp079KCBiSh3fvuugnNlSTZaz31h2yZfTJx30dPidFE5IPqUvX5HJtt8nfnO-YfMyfVsVLtnh7fi1mi8yxHNoMBZO6wlJRoUHpspTaonVSaMeUQy2UxxJzhbwSWHFh1yxH7pyuGIK2lo_J_al3F5vvzqfWbJouhn7SsD6qARjwPkVPKReblKJfm12sv2w8GKDmqMP0OsxRhznr6BH1B3F1a9u6CW209fY_8O4E1t773x1UFLhE_gPbD2xD
CODEN	IETAA9
CitedBy_id	crossref_primary_10_1080_00207721_2023_2210139 crossref_primary_10_1109_TCNS_2022_3219765 crossref_primary_10_1109_TIE_2022_3231272 crossref_primary_10_1109_TAC_2019_2902731 crossref_primary_10_1109_TSMC_2025_3570718 crossref_primary_10_1016_j_automatica_2024_112071 crossref_primary_10_1016_j_sysconle_2022_105291 crossref_primary_10_1177_09596518251346998 crossref_primary_10_1002_rnc_7688 crossref_primary_10_1016_j_ijepes_2024_110407 crossref_primary_10_1109_TASE_2025_3571457 crossref_primary_10_1109_TSG_2021_3091624 crossref_primary_10_1016_j_epsr_2022_108357 crossref_primary_10_1109_TCNS_2024_3401268 crossref_primary_10_1109_TIFS_2021_3106161 crossref_primary_10_1109_TSP_2020_3006760 crossref_primary_10_1016_j_neucom_2024_127986 crossref_primary_10_1016_j_neucom_2022_06_074 crossref_primary_10_1109_TCSI_2024_3401223 crossref_primary_10_1007_s11768_020_00023_x crossref_primary_10_1016_j_jfranklin_2022_08_031 crossref_primary_10_1002_rnc_7798 crossref_primary_10_1109_TASE_2024_3492018 crossref_primary_10_1016_j_automatica_2023_111150 crossref_primary_10_1016_j_sysconle_2024_105717 crossref_primary_10_1016_j_amc_2025_129612 crossref_primary_10_1109_JAS_2024_124731 crossref_primary_10_1109_TAES_2024_3524215 crossref_primary_10_1002_acs_3424 crossref_primary_10_1109_TSMC_2025_3550524 crossref_primary_10_1109_TAC_2024_3379256 crossref_primary_10_1016_j_automatica_2023_110878 crossref_primary_10_1016_j_automatica_2024_111769 crossref_primary_10_1109_TAC_2025_3546087 crossref_primary_10_1109_TAC_2025_3535755 crossref_primary_10_1109_TIFS_2025_3593357 crossref_primary_10_1016_j_chaos_2025_117117 crossref_primary_10_1109_TII_2023_3280318 crossref_primary_10_1109_TNSE_2022_3140274 crossref_primary_10_1109_TSG_2022_3171267 crossref_primary_10_1016_j_automatica_2025_112452 crossref_primary_10_1016_j_cnsns_2025_108918 crossref_primary_10_1016_j_isatra_2022_11_003 crossref_primary_10_1109_TAC_2023_3256479 crossref_primary_10_1016_j_jai_2025_08_004 crossref_primary_10_1016_j_automatica_2022_110223 crossref_primary_10_1007_s10846_024_02161_9 crossref_primary_10_1109_TNSE_2022_3151380 crossref_primary_10_1016_j_ifacol_2020_12_973 crossref_primary_10_1109_TII_2019_2933596 crossref_primary_10_1016_j_jisa_2021_102949 crossref_primary_10_1109_LCSYS_2024_3365418 crossref_primary_10_1109_TIE_2023_3274846 crossref_primary_10_1007_s12597_025_00965_3 crossref_primary_10_1109_TCSI_2021_3081372 crossref_primary_10_1109_TCSII_2022_3204942 crossref_primary_10_1109_TIFS_2021_3096121 crossref_primary_10_1109_TSP_2022_3182590 crossref_primary_10_1109_ACCESS_2023_3322035 crossref_primary_10_1016_j_neucom_2021_10_019 crossref_primary_10_1109_TCSII_2021_3095952 crossref_primary_10_1109_TAES_2021_3124866 crossref_primary_10_1109_TSMC_2024_3379375 crossref_primary_10_1002_rnc_8051 crossref_primary_10_1109_TCSII_2023_3265567 crossref_primary_10_1109_TSIPN_2024_3485480 crossref_primary_10_1145_3591354 crossref_primary_10_1109_TII_2023_3240878 crossref_primary_10_1016_j_automatica_2025_112277 crossref_primary_10_1109_TII_2024_3475418 crossref_primary_10_1109_TCSII_2020_3047850 crossref_primary_10_1002_rnc_7747 crossref_primary_10_1002_asjc_3081 crossref_primary_10_1016_j_automatica_2022_110527 crossref_primary_10_1016_j_eswa_2022_117086 crossref_primary_10_1016_j_isatra_2022_10_027 crossref_primary_10_1109_TASE_2022_3217677 crossref_primary_10_1109_TAC_2022_3174187 crossref_primary_10_1002_rnc_6303 crossref_primary_10_1109_TII_2023_3348816 crossref_primary_10_1109_TASE_2023_3267034 crossref_primary_10_1109_TCSII_2022_3144389 crossref_primary_10_1109_TAC_2024_3470848 crossref_primary_10_1109_TAC_2024_3386988 crossref_primary_10_1109_TASE_2024_3485922 crossref_primary_10_1109_LSP_2025_3542636 crossref_primary_10_1109_TSG_2022_3189665 crossref_primary_10_32604_csse_2024_054556 crossref_primary_10_1016_j_isatra_2024_08_015 crossref_primary_10_1016_j_ins_2022_02_055 crossref_primary_10_1016_j_jai_2023_10_001 crossref_primary_10_1002_rnc_5003 crossref_primary_10_1109_TSIPN_2024_3402430 crossref_primary_10_1016_j_neucom_2025_130239 crossref_primary_10_1016_j_automatica_2024_112094 crossref_primary_10_1109_LCSYS_2020_3046432 crossref_primary_10_1007_s40747_025_01937_2 crossref_primary_10_1016_j_arcontrol_2024_100983 crossref_primary_10_1016_j_energy_2025_136627 crossref_primary_10_1109_ACCESS_2024_3353289 crossref_primary_10_1109_TIA_2025_3549393 crossref_primary_10_1109_LCSYS_2023_3308144 crossref_primary_10_1109_TSG_2024_3390108 crossref_primary_10_1016_j_ifacol_2023_10_1032 crossref_primary_10_1109_MCS_2021_3062956 crossref_primary_10_1109_TASE_2025_3535924 crossref_primary_10_3390_s23062904 crossref_primary_10_1109_MIS_2020_3006081 crossref_primary_10_1109_TAC_2024_3390574 crossref_primary_10_1109_TII_2024_3381645 crossref_primary_10_1109_TNNLS_2024_3488115 crossref_primary_10_1007_s11063_025_11717_1 crossref_primary_10_1002_rnc_6684 crossref_primary_10_1109_TCNS_2024_3408008 crossref_primary_10_1016_j_sysconle_2023_105608 crossref_primary_10_1109_TCYB_2023_3267145 crossref_primary_10_1109_TCYB_2025_3579593 crossref_primary_10_1016_j_arcontrol_2023_100913 crossref_primary_10_1109_LSP_2020_3029706 crossref_primary_10_1631_FITEE_2300532 crossref_primary_10_1109_TAC_2023_3348158 crossref_primary_10_1109_TCNS_2021_3124926 crossref_primary_10_1109_TAC_2024_3386055 crossref_primary_10_1109_JSYST_2023_3305358 crossref_primary_10_1016_j_cja_2025_103751 crossref_primary_10_1007_s42979_021_00796_1 crossref_primary_10_1109_TSMC_2022_3220578 crossref_primary_10_1016_j_sysconle_2025_106147 crossref_primary_10_1109_TIT_2024_3370311 crossref_primary_10_1109_TAC_2024_3351869 crossref_primary_10_1109_TMECH_2025_3570933 crossref_primary_10_1016_j_automatica_2020_109283 crossref_primary_10_1109_TAC_2024_3383795 crossref_primary_10_1109_TSIPN_2023_3322783 crossref_primary_10_1109_TSIPN_2021_3112928 crossref_primary_10_1109_TIT_2023_3300711 crossref_primary_10_1109_TCNS_2025_3526713 crossref_primary_10_1088_3050_2454_adea7a crossref_primary_10_1109_TII_2023_3321027 crossref_primary_10_1109_TAC_2024_3518356 crossref_primary_10_1137_19M127879X crossref_primary_10_1109_LCSYS_2022_3166759 crossref_primary_10_1109_TETCI_2024_3386692 crossref_primary_10_1007_s40815_022_01436_3 crossref_primary_10_1016_j_automatica_2022_110621 crossref_primary_10_1016_j_sysconle_2022_105415 crossref_primary_10_1109_TSMC_2024_3496488 crossref_primary_10_1109_TITS_2024_3402962 crossref_primary_10_1016_j_cnsns_2024_108356 crossref_primary_10_1007_s11432_024_4328_1 crossref_primary_10_1016_j_fss_2024_109171 crossref_primary_10_1002_rnc_8029 crossref_primary_10_1016_j_ins_2024_121843 crossref_primary_10_1016_j_automatica_2022_110182 crossref_primary_10_1109_TSMC_2024_3517473 crossref_primary_10_1016_j_inffus_2024_102312 crossref_primary_10_1109_TII_2022_3141428 crossref_primary_10_1109_TCNS_2022_3182234 crossref_primary_10_1109_ACCESS_2020_3027832 crossref_primary_10_1109_TSG_2023_3309405 crossref_primary_10_1109_TCNS_2021_3094788 crossref_primary_10_1109_TAC_2025_3539731 crossref_primary_10_1016_j_jfranklin_2025_108016 crossref_primary_10_1109_TASE_2024_3493136 crossref_primary_10_1002_rnc_7906 crossref_primary_10_1109_JAS_2023_124122 crossref_primary_10_1109_TCYB_2025_3589627 crossref_primary_10_1109_LCSYS_2022_3155263 crossref_primary_10_1145_3587933 crossref_primary_10_1016_j_automatica_2020_109253 crossref_primary_10_1007_s12555_021_0114_0 crossref_primary_10_1109_TSP_2020_3027917 crossref_primary_10_1080_00207721_2022_2070794 crossref_primary_10_1109_TAC_2020_3022856 crossref_primary_10_1109_TSG_2021_3105651 crossref_primary_10_1109_TSMC_2022_3177756 crossref_primary_10_1109_TCNS_2023_3298198 crossref_primary_10_1016_j_automatica_2020_109242 crossref_primary_10_1109_TITS_2022_3154650 crossref_primary_10_1109_TIFS_2025_3588670 crossref_primary_10_1109_TCNS_2024_3354875 crossref_primary_10_1016_j_ins_2020_06_074 crossref_primary_10_1002_rnc_7389 crossref_primary_10_1016_j_jfranklin_2024_107423 crossref_primary_10_1109_TITS_2024_3519444 crossref_primary_10_1109_TSG_2024_3467392 crossref_primary_10_1016_j_jfranklin_2025_107836 crossref_primary_10_1109_TCNS_2022_3155109 crossref_primary_10_1016_j_automatica_2024_111715 crossref_primary_10_1016_j_automatica_2023_111417 crossref_primary_10_1002_rnc_7929 crossref_primary_10_1109_LCSYS_2023_3285143 crossref_primary_10_1109_TCSII_2022_3219929 crossref_primary_10_1109_LCSYS_2023_3284608 crossref_primary_10_1109_JAS_2023_123921 crossref_primary_10_1109_TCNS_2023_3290114 crossref_primary_10_3390_s24072090
Cites_doi	10.1145/359340.359342 10.1109/CDC.2016.7799302 10.1109/TKDE.2006.14 10.1080/00207179.2017.1326632 10.23919/ECC.2013.6669251 10.1109/ALLERTON.2016.7852360 10.1137/16M1084316 10.1109/TAC.2016.2564339 10.1109/MSP.2012.2219653 10.1145/2381966.2381978 10.1109/PES.2011.6039422 10.1016/j.ifacol.2015.10.331 10.1109/TAC.2010.2041686 10.1109/CDC.2015.7403296 10.1109/TPDS.2013.45 10.1109/JPROC.2006.887293 10.2307/2285509 10.1109/TAC.2004.841888 10.1145/2684464.2684480 10.1002/0470083980 10.1109/CDC.2015.7402925 10.1109/TKDE.2009.153 10.23919/ACC.2017.7963642 10.1109/CDC.2016.7799042 10.1016/j.automatica.2017.03.016 10.1109/ICASSP.2014.6855039 10.1109/JIOT.2018.2834544 10.1002/rnc.3178 10.1109/CDC.2014.7039593 10.1145/3140241.3140243
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D
DOI	10.1109/TAC.2019.2890887
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library (IEL) (UW System Shared) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-2523
EndPage	4049
ExternalDocumentID	10_1109_TAC_2019_2890887 8601358
Genre	orig-research
GrantInformation_xml	– fundername: National Science Foundation grantid: 1824014; 1738902 funderid: 10.13039/501100008982
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 VJK ~02 AAYXX CITATION 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D RIG
ID	FETCH-LOGICAL-c291t-84257d8b6047167bb57a8ac547c26c8746e8b89683d48d34af2983cc7d2817aa3
IEDL.DBID	RIE
ISICitedReferencesCount	242
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000490772500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9286
IngestDate	Mon Jun 30 10:17:27 EDT 2025 Tue Nov 18 21:47:05 EST 2025 Sat Nov 29 05:40:52 EST 2025 Wed Aug 27 02:41:43 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	10
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c291t-84257d8b6047167bb57a8ac547c26c8746e8b89683d48d34af2983cc7d2817aa3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-6778-7838 0000-0002-8600-0276 0000-0003-1911-2005
PQID	2298711213
PQPubID	85475
PageCount	15
ParticipantIDs	proquest_journals_2298711213 ieee_primary_8601358 crossref_primary_10_1109_TAC_2019_2890887 crossref_citationtrail_10_1109_TAC_2019_2890887
PublicationCentury	2000
PublicationDate	2019-10-01
PublicationDateYYYYMMDD	2019-10-01
PublicationDate_xml	– month: 10 year: 2019 text: 2019-10-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on automatic control
PublicationTitleAbbrev	TAC
PublicationYear	2019
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref35 ref13 (ref43) 0 ref12 ref37 ref15 zhang (ref39) 2011 ref36 ref14 ref31 ref30 ref33 ref11 ref10 liu (ref34) 2006; 18 ref2 ref1 ref17 katz (ref27) 2008 goldreich (ref29) 2007 ref16 ref19 ref18 tsitsiklis (ref5) 1984 nedi? (ref32) 2016 ref24 ref23 paillier (ref26) 1999 lynch (ref3) 1996 ref20 ref22 ref21 goldreich (ref38) 2009 bethencourt (ref41) 0 ref8 ref7 ref9 ref4 elgamal (ref25) 1985 goldreich (ref28) 2001 ref6 ref40 (ref42) 0
References_xml	– start-page: 1023 year: 2016 ident: ref32 article-title: A geometrically convergent method for distributed optimization over time-varying graphs publication-title: Proc 55th IEEE Conf Decis Control – ident: ref24 doi: 10.1145/359340.359342 – ident: ref18 doi: 10.1109/CDC.2016.7799302 – year: 1984 ident: ref5 article-title: Problems in decentralized decision making and computation – volume: 18 start-page: 92 year: 2006 ident: ref34 article-title: Random projection-based multiplicative data perturbation for privacy preserving distributed data mining publication-title: IEEE Trans Knowl Data Eng doi: 10.1109/TKDE.2006.14 – ident: ref10 doi: 10.1080/00207179.2017.1326632 – year: 2007 ident: ref29 publication-title: Foundations of Cryptography Volume 1 Basic Tools – ident: ref13 doi: 10.23919/ECC.2013.6669251 – ident: ref23 doi: 10.1109/ALLERTON.2016.7852360 – start-page: 1 year: 2011 ident: ref39 article-title: Distributed cooperative spectrum sensing based on weighted average consensus publication-title: Proc IEEE Global Telecommun Conf – year: 0 ident: ref42 publication-title: Source Code for Confidential Average Consensus – ident: ref31 doi: 10.1137/16M1084316 – ident: ref12 doi: 10.1109/TAC.2016.2564339 – year: 1996 ident: ref3 publication-title: Distributed Algorithms – ident: ref21 doi: 10.1109/MSP.2012.2219653 – ident: ref11 doi: 10.1145/2381966.2381978 – year: 2008 ident: ref27 publication-title: Introduction to Modern Cryptography Principles and Protocols – ident: ref6 doi: 10.1109/PES.2011.6039422 – ident: ref7 doi: 10.1016/j.ifacol.2015.10.331 – year: 0 ident: ref43 publication-title: Paillier Library – ident: ref33 doi: 10.1109/TAC.2010.2041686 – ident: ref19 doi: 10.1109/CDC.2015.7403296 – ident: ref36 doi: 10.1109/TPDS.2013.45 – year: 0 ident: ref41 article-title: Advanced crypto software collection. – ident: ref4 doi: 10.1109/JPROC.2006.887293 – start-page: 223 year: 1999 ident: ref26 publication-title: Public-key cryptosystems based on composite degree residuosity classes – year: 2001 ident: ref28 publication-title: Foundations of Cryptography Volume 2 Basic Applications – ident: ref2 doi: 10.2307/2285509 – ident: ref30 doi: 10.1109/TAC.2004.841888 – ident: ref8 doi: 10.1145/2684464.2684480 – ident: ref37 doi: 10.1002/0470083980 – year: 2009 ident: ref38 publication-title: Foundations of Cryptography Volume 2 Basic Applications – ident: ref40 doi: 10.1109/CDC.2015.7402925 – ident: ref35 doi: 10.1109/TKDE.2009.153 – ident: ref17 doi: 10.23919/ACC.2017.7963642 – ident: ref20 doi: 10.1109/CDC.2016.7799042 – ident: ref9 doi: 10.1016/j.automatica.2017.03.016 – ident: ref22 doi: 10.1109/ICASSP.2014.6855039 – ident: ref14 doi: 10.1109/JIOT.2018.2834544 – ident: ref15 doi: 10.1002/rnc.3178 – ident: ref16 doi: 10.1109/CDC.2014.7039593 – ident: ref1 doi: 10.1145/3140241.3140243 – start-page: 10 year: 1985 ident: ref25 publication-title: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
SSID	ssj0016441
Score	2.6847653
Snippet	Consensus is fundamental for distributed systems since it underpins key functionalities of such systems ranging from distributed information fusion, decision...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	4035
SubjectTerms	Algorithms Computer networks Computer simulation Consensus Convergence Cryptography Data integration Decentralized control Decision making digital signature Encryption Exchanging Microcontrollers Multisensor fusion Nodes partial homomorphic cryptography Privacy privacy preservation Protocols Quantization (signal) security Topology
Title	Secure and Privacy-Preserving Consensus
URI	https://ieeexplore.ieee.org/document/8601358 https://www.proquest.com/docview/2298711213
Volume	64
WOSCitedRecordID	wos000490772500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1558-2523 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016441 issn: 0018-9286 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JSwMxFH60xYMe3KpYrTIHQQSnnS3bUYrFU-mhQm9DllcpyFS6gf_eJDMdCorgnOaQDJkvyXt5S94HcJ8RKRJG4pCijJzrhoQKsyg0MWepRKtzifJkE2w04tOpGDfgqb4Lg4g--Qx77tXH8s1Cb5yrrM-t9ZAS3oQmY6y8q1VHDJxeL6Wu3cAJr0OSkehPngcuh0v0XFDNJ8_tqSDPqfJDEHvtMjz537hO4bg6RQbP5bSfQQOLczjaqy3YhgfvScdAFiYYL-dbqb9Cl2_hZEPxHjiiTsdysbqAt-HLZPAaVqwIoU5EvA5d3IwZrmhk9QplShEmudQkYzqhmrOMIldcUJ6ajJs0k7NE8FRrZhIeMynTS2gViwKvIJBKUjmjiCIz1o6Uyj4YG2tTEYUJwQ70d0DluioZ7pgrPnJvOkQit9DmDtq8grYDj3WPz7Jcxh9t2w7Kul2FYge6u7nIq_20yhP7Dyx25eeuf-91A4fu22WaXRda6-UGb-FAb9fz1fLOL5VvJBi5lQ
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB7WVVAPvsX12YMggnXbNGmSo4iLoi4eVvBW8hhlQbqyuwr-e5O0WwRFsKceEpp-SWYyj8wHcEyZkoSzNM5RJd51w2KNNIltKnim0OlcpgPZBO_3xdOTfGjBWXMXBhFD8hme-9cQy7cj8-5dZV3hrIeMiTmYZ5SStLqt1cQMvGav5K7bwkQ0QclEdgcXlz6LS577sFpIn_umhAKryg9RHPRLb_V_I1uDlfocGV1UE78OLSw3YPlbdcFNOAm-dIxUaaOH8fBDmc_YZ1x46VC-RJ6q0_NcTLbgsXc1uLyOa16E2BCZTmMfOeNW6DxxmiXnWjOuhDKMckNyIzjNUWghc5FZKmxG1TORIjOGWyJSrlS2De1yVOIOREqrXD3niJJaZ0kq7R5MrbOqmEbCsAPdGVCFqYuGe-6K1yIYD4ksHLSFh7aooe3AadPjrSqY8UfbTQ9l065GsQP7s7ko6h01KYj7B576AnS7v_c6gsXrwf1dcXfTv92DJf-dKuluH9rT8TsewIL5mA4n48OwbL4A-kq83A
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Secure+and+Privacy-Preserving+Consensus&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Ruan%2C+Minghao&rft.au=Gao%2C+Huan&rft.au=Wang%2C+Yongqiang&rft.date=2019-10-01&rft.issn=0018-9286&rft.eissn=1558-2523&rft.volume=64&rft.issue=10&rft.spage=4035&rft.epage=4049&rft_id=info:doi/10.1109%2FTAC.2019.2890887&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TAC_2019_2890887
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9286&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9286&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9286&client=summon