"Quantum Byzantine agreement"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎메타데이터: 새 문단)
 
27번째 줄: 27번째 줄:
 
  <references />
 
  <references />
  
−
== 메타데이터 ==
+
==메타데이터==
−
 
 
 
===위키데이터===
 
===위키데이터===
 
* ID :  [https://www.wikidata.org/wiki/Q17083590 Q17083590]
 
* ID :  [https://www.wikidata.org/wiki/Q17083590 Q17083590]
 +
===Spacy 패턴 목록===
 +
* [{'LOWER': 'quantum'}, {'LOWER': 'byzantine'}, {'LEMMA': 'agreement'}]

2021년 2월 17일 (수) 00:37 기준 최신판

노트

위키데이터

말뭉치

  1. In Byzantine agreement, the faulty players are allowed to behave arbitrarily (including actively breaking the protocol, colluding etc).[1]
  2. A Byzantine Agreement protocol is formally defined to satisfy the criteria agreement, validity and termination.[1]
  3. In Byzantine Agreement, node failures are modelled as Byzantine Failures.[1]
  4. The protocol considers the simplest (i.e., three-player) BA problem involving one broadcaster and two receivers who jointly participant in the distribution, test, and agreement phases.[2]
  5. The GHZ-like states provide the quantum resources for implementing the primitive of BA and satisfy a priori entanglement bound.[2]
  6. The Byzantine Agreement protocol is a protocol in distributed computing.[3]
  7. In such a setting, Byzantine agreement offers the "best alternative" to broadcasting.[4]
  8. In this paper, we propose a protocol of quantum communication to achieve Byzantine agreement among multiple parties.[5]
  9. (2015) Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity.[6]
  10. On expected constant-round protocols for Byzantine agreement.[6]
  11. Byzantine agreement for reputation management in DHT-based peer-to-peer networks.[6]
  12. Abstract: In this paper, we propose a protocol of quantum communication to achieve Byzantine agreement among multiple parties.[7]
  13. Cannot be the next communication of byzantine agreement revisited for any fault tolerance in the interruption.[8]
  14. While others prefer to the byzantine agreement revisited significant in two commands: attack and the players.[8]
  15. Also describe some phenomena that for communication complexity byzantine agreement protocols in an essential part of army generals may forge false votes via messengers who may not.[8]
  16. Referenced by the presence of byzantine agreement revisited guarantees that the interruption.[8]
  17. Our proposed multi-cloud data management model uses Shamir’s Secret Sharing approach and a Quantum Byzantine Agreement protocol.[9]
  18. In distributed computing,Byzantine agreement is a practical method to solve its fault-tolerance problem.[10]
  19. There is a variation of the Byzantine agreement which is called detectable Byzantine agreement.[10]
  20. However a variation of the Byzantine agreement problem, called detectable Byzantine agreement (DBA), can be solved by using quantum resources.[11]

소스

  1. ↑ 1.0 1.1 1.2 Quantum Protocol Zoo
  2. ↑ 2.0 2.1 Quantum Byzantine Agreement with Tripartite Entangled States
  3. ↑ Quantum Byzantine agreement
  4. ↑ (PDF) Fast quantum byzantine agreement
  5. ↑ Multi-Party Quantum Byzantine Agreement without Entanglement.
  6. ↑ 6.0 6.1 6.2 Fully Polynomial Byzantine Agreement for n > 3 t Processors in t + 1 Rounds
  7. ↑ Multi-Party Quantum Byzantine Agreement without Entanglement.
  8. ↑ 8.0 8.1 8.2 8.3 Communication Complexity Of Byzantine Agreement Revisited
  9. ↑ Multi-Cloud Data Management Using Shamir's Secret Sharing and Quantum Byzantine Agreement Schemes
  10. ↑ 10.0 10.1 Entangled state testing in the quantum Byzantine agreement
  11. ↑ Multi-party Quantum Byzantine Agreement Without Entanglement

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'quantum'}, {'LOWER': 'byzantine'}, {'LEMMA': 'agreement'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=Quantum_Byzantine_agreement&oldid=51008"