Write, autoreview, editor, reviewer
3,129
edits
Line 8: | Line 8: | ||
==Structure== | ==Structure== | ||
'*'Each page is independent and does not require any extra information yet links are provided for better understanding of some concepts in all such descriptions. | '*'Each page is independent and does not require any extra information yet links are provided for better understanding of some concepts in all such descriptions. | ||
'''Functionality Description''' | |||
---- | ---- | ||
A lucid definition of functionality achieved and properties satisfied by the method used. | A lucid definition of functionality achieved and properties satisfied by the method used. | ||
'''Use Case''' | |||
---- | |||
Bridges the gap between users and protocol designers. | Bridges the gap between users and protocol designers. | ||
'''Tags:''' Any related page or list of protocols is connected by this section | '''Tags:''' Any related page or list of protocols is connected by this section | ||
'''Outline''' | |||
---- | |||
A non-mathematical detailed outline which provides a rough idea of the method described. A figure is accommodated for most protocols. | A non-mathematical detailed outline which provides a rough idea of the method described. A figure is accommodated for most protocols. | ||
'''Requirements''' | |||
**Network Stage: | |||
**Technological Readiness: | |||
'''Example''' | |||
---- | |||
**'''Properties''' A list of important information extracted from the protocol which is not obvious from the outline such as, Parameters (threshold values), security claim, success probability, adversarial assumption (see [[Quantum Adversary Definitions|Quantum Adversary Definitions), setup assumptions, etc.. | |||
* | |||
* | |||
**'''Pseudo Code''' Mathematical step-wise protocol algorithm | |||
**Relevant papers | |||
---- | |||
Papers one would find easy to understand after reading the concerned formal description. | Papers one would find easy to understand after reading the concerned formal description. | ||