FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1564893486> ?p ?o ?g. }

• W1564893486 endingPage "155" @default.
• W1564893486 startingPage "137" @default.
• W1564893486 abstract "In this paper, we study the problem of perfectly reliable message transmission(PRMT) and perfectly secure message transmission(PSMT) between a sender S and a receiver R in an undirected synchronous network, tolerating a mixed where the adversary can be either or mobile. The connectivity requirement, phase complexityand communication complexityare three important parameters of any interactive PRMT/PSMT protocol and are well studied in the literature in the presence of a static/mobile However, in the presence of a mixed we encounter several surprising consequences. In this paper, we prove that even though the connectivity requirement for PRMT is same against both and mobile mixed the lower bound on communication complexity for PRMT tolerating a mobile mixed adversary is more than its mixed counterpart. This is interesting because against a Byzantine adversary, the connectivity requirement and the lower bound on the communication complexity of PRMT protocols are same for both and mobile case. Thus our result shows that for PRMT, a mobile mixed adversary is more powerful than its counterpart. As our second contribution, we design a four phase communication optimal PSMT protocol tolerating a static mixed adversary. Comparing this with the existing three phase communication optimal PSMT protocol against a static adversary, we find that additional one phase is enough to design communication optimal protocol against a mixed Finally, we show that the connectivity requirement and lower bound on communication complexity of any PSMT protocol is same against both and mobile mixed thus proving that mobility of the adversary has no effect on PSMT. To show that our bound is tight, we also present a worst case nine phase communication optimal PSMT protocol tolerating a mobile mixed adversary which is first of it's kind. This also shows that the mobility of the adversary does not hinder to design constant phase communication optimal PSMT protocol. In our protocols, we have used new techniques which can be effectively used against both and mobile mixed adversary and are of independent interest." @default.
• W1564893486 created "2016-06-24" @default.
• W1564893486 creator A5003043405 @default.
• W1564893486 creator A5005722897 @default.
• W1564893486 creator A5053440693 @default.
• W1564893486 creator A5054641777 @default.
• W1564893486 creator A5070586393 @default.
• W1564893486 date "2008-08-12" @default.
• W1564893486 modified "2023-09-26" @default.
• W1564893486 title "Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary" @default.
• W1564893486 cites W1499281737 @default.
• W1564893486 cites W1505726608 @default.
• W1564893486 cites W1509903572 @default.
• W1564893486 cites W1549890695 @default.
• W1564893486 cites W1604064347 @default.
• W1564893486 cites W1808659847 @default.
• W1564893486 cites W1964378537 @default.
• W1564893486 cites W1965492831 @default.
• W1564893486 cites W1980461136 @default.
• W1564893486 cites W2006453614 @default.
• W1564893486 cites W2027471022 @default.
• W1564893486 cites W2092148937 @default.
• W1564893486 cites W2143067599 @default.
• W1564893486 cites W2180989652 @default.
• W1564893486 cites W3141585064 @default.
• W1564893486 doi "https://doi.org/10.1007/978-3-540-85093-9_15" @default.
• W1564893486 hasPublicationYear "2008" @default.
• W1564893486 type Work @default.
• W1564893486 sameAs 1564893486 @default.
• W1564893486 citedByCount "11" @default.
• W1564893486 countsByYear W15648934862012 @default.
• W1564893486 countsByYear W15648934862015 @default.
• W1564893486 countsByYear W15648934862018 @default.
• W1564893486 crossrefType "book-chapter" @default.
• W1564893486 hasAuthorship W1564893486A5003043405 @default.
• W1564893486 hasAuthorship W1564893486A5005722897 @default.
• W1564893486 hasAuthorship W1564893486A5053440693 @default.
• W1564893486 hasAuthorship W1564893486A5054641777 @default.
• W1564893486 hasAuthorship W1564893486A5070586393 @default.
• W1564893486 hasConcept C108827166 @default.
• W1564893486 hasConcept C31258907 @default.
• W1564893486 hasConcept C38652104 @default.
• W1564893486 hasConcept C41008148 @default.
• W1564893486 hasConcept C41065033 @default.
• W1564893486 hasConceptScore W1564893486C108827166 @default.
• W1564893486 hasConceptScore W1564893486C31258907 @default.
• W1564893486 hasConceptScore W1564893486C38652104 @default.
• W1564893486 hasConceptScore W1564893486C41008148 @default.
• W1564893486 hasConceptScore W1564893486C41065033 @default.
• W1564893486 hasLocation W15648934861 @default.
• W1564893486 hasOpenAccess W1564893486 @default.
• W1564893486 hasPrimaryLocation W15648934861 @default.
• W1564893486 hasRelatedWork W17533771 @default.
• W1564893486 hasRelatedWork W2048406491 @default.
• W1564893486 hasRelatedWork W2130966263 @default.
• W1564893486 hasRelatedWork W2412036290 @default.
• W1564893486 hasRelatedWork W2499292486 @default.
• W1564893486 hasRelatedWork W3001351446 @default.
• W1564893486 hasRelatedWork W3103039594 @default.
• W1564893486 hasRelatedWork W4221142798 @default.
• W1564893486 hasRelatedWork W4285163392 @default.
• W1564893486 hasRelatedWork W4298144666 @default.
• W1564893486 isParatext "false" @default.
• W1564893486 isRetracted "false" @default.
• W1564893486 magId "1564893486" @default.
• W1564893486 workType "book-chapter" @default.