Search results

...2.2013.766827|s2cid=6744219|issn=0092-7872}}</ref> In many cases, tropical cryptographic schemes have arisen from adapting classical (non-tropical) schemes to inste ...

* <math>N_A</math> and <math>N_B</math> are [[cryptographic nonce|nonces]] generated by A and B respectively ...iang | last5=Chen | title=Two attacks on Neuman-Stubblebine authentication protocols | place=Tainan, Taiwan | year=1994 | doi = 10.1016/0020-0190(95)00177-E | j ...

...s, and [[matrix group]]s have been identified as potential candidates for cryptographic applications. In contrast to non-commutative cryptography, the currently wi ...[[authentication]]. These protocols are very similar to the corresponding protocols in the commutative case. ...

...been described as being inefficient compared to alternative authentication protocols.<ref name="stallings">{{cite book|last=Stallings|first=William|title=Crypto :<math>N_x</math> - [[Cryptographic nonce|nonce]] chosen by <math>x</math>. ...

* <math>N_A</math> and <math>N_B</math> are [[cryptographic nonce|nonces]] generated by A and B respectively [[Category:Cryptographic protocols]] ...

{{short description|Cryptographic protocol designed to resist quantum computer attacks}} [[Category:Cryptographic protocols]] ...

{{short description|Proposed cryptographic primitive}} In [[cryptography]], '''black-box obfuscation''' was a proposed [[cryptographic primitive]] which would allow a [[computer program]] to be [[obfuscation (s ...

...rcome the shortcoming of [[Client Puzzle Protocol|computation-based puzzle protocols]], in which [[Client (computing)|clients]] are required to compute hard CPU ...</math>, <math>ts</math> is a coarse timestamp, and <math>hash</math> is a cryptographic hash function such as [[SHA-1]]. ...

...d encryption]], and [[broadcast encryption]]. There exist constructions of cryptographic 2-multilinear maps, known as bilinear maps,<ref name="pairingSurvey" /> how title=Pairing-Based Cryptographic Protocols : A Survey|journal=e-Print IACR| ...

...|TLS]] etc. The authentication is based on public key pairs. As with other protocols, YAK normally requires a [[Public Key Infrastructure]] to distribute authen ...erial <math>K</math>, Alice and Bob can derive a [[session key]] using a [[cryptographic hash function]]: <math>\kappa = H(K)</math>. ...

...id=18643410|bibcode=2008PhRvL.100v0502W|s2cid=2974264}}</ref> refers to a cryptographic model employed in [[quantum cryptography]]. It assumes that the quantum mem ...ain goal of this model is to enable the secure implementation of two-party cryptographic primitives, such as [[bit commitment]], [[oblivious transfer]] and [[Smart ...

...shel, and [[Dorian M. Goldfeld|Dorian Goldfeld]]. Unlike other group-based protocols, it does not employ any commuting or commutative subgroups of a given platf [[Category:Cryptographic protocols]] ...

...hy is a sub-field of relativistic cryptography, in which [[cryptographic]] protocols exploit the no-superluminal signalling principle, independently of whether ..."/><ref name="practicalrelcomm"/><ref name="AdlamKent15DIRQBC"/> and other cryptographic tasks have been investigated in the setting of relativistic quantum cryptog ...

...istribution processes are not considered as part of the definition of this cryptographic scheme. .... |author-link1=Steven Murdoch |date=March 2016 |title=Insecure by Design: Protocols for Encrypted Phone Calls |journal=Computer |publisher=IEEE |volume=49 |iss ...

...tive secret sharing''' is an underlying technique in '''Proactive Security Protocols.''' ...12600.112605]</ref> The method has been used in the areas of cryptographic protocols in [[secure multi-party computation]] and in [[threshold cryptosystem]]s. ...

A '''quantum money''' scheme is a [[Quantum Cryptography|quantum cryptographic]] protocol that creates and verifies banknotes that are resistant to [[Forg .../ref> and later influenced the development of [[quantum key distribution]] protocols used in [[quantum cryptography]]. ...

...pping|coin tossing]], which were also the first relativistic cryptographic protocols.<ref name="Kent99commitment"/><ref name="Kent99cointossing"/> He is a co-in ...<ref name="Kent99commitment"/><ref name="Kent99cointossing"/> relativistic protocols that evade no-go theorem by Mayers, Lo and Chau, and by Lo and Chau, respec ...

{{Short description|Cryptographic technique}} ...ip |title=Random Oracles are Practical: A Paradigm for Designing Efficient Protocols |date=1995 |pages=62–73 |publisher=ACM Press|citeseerx=10.1.1.50.3345 }}</r ...

...or-secure-computations>{{cite conference |last=Yao |first=Andrew C. |title=Protocols for secure computations |book-title=23rd Annual Symposium on Foundations of ==Protocols and proof== ...

...by Juggling]. ''Proceedings of the 16th International Workshop on Security Protocols, 2008.''</ref> This protocol allows two parties to establish private and au ...erial <math>K</math>, Alice and Bob can derive a [[session key]] using a [[Cryptographic hash function]]: <math>\kappa = H(K)</math>. ...