New answers tagged

1

RFC 4279, section 5.2, says this about identity hints: In the absence of an application profile specification specifying otherwise, servers SHOULD NOT provide an identity hint and clients MUST ignore the identity hint field. Applications that do use this field MUST specify its contents, how the value is chosen by the TLS server, and what the TLS client is ...


0

As NEWHOPE builds its security proof based upon previous works, and that Google has been experimenting with it, I think I should read the paper more thoroughly and hop along.


1

Let's approach the question from this direction. PAKE tries to solve this problem: Alice has a password $PW_{a}$, and Bob has a password $PW_{b}$; consider a protocol where Alice and Bob exchange messages, and generate encryption keys $E_{a}, E_{b}$ where $E_{a} = E_{b}$ if $PW_a = PW_b$ (and unrelated if $PW_a \ne PW_b$); if they're the same, Alice and Bob ...


1

How does one verify a key revocation? As Jon Callas already stated: you simply don’t. In case a different wording helps, here’s a quote related to the exact same question… https://lists.gnupg.org/pipermail/gnupg-users/2014-February/049100.html … On 02/19/2014 11:55 AM, Hauke Laging wrote: Am Di 18.02.2014, 23:19:33 schrieb Tadas ...


1

Blockchains seem to be a common buzzword these days. And more often than not it is used by people, who don't understand the actual concept in detail. For example, that blockchains are based on assumptions about the distribution of processing power. And when you use it outside the context of bitcoins, you still need an incentive for many people to contribute, ...


0

First, the name keyless signature infrastructure is inherently misleading as this actually has nothing to do with real digital signatures, it is rather some kind of time-stamping service. Now, to answer your actual question: These KSI constructions are solely based on the security of cryptographic hash functions. They do not make use of any other hardness ...


1

I would just like to know on what basis they can say it is PQC without any NP problem reduction. I believe that the point you're making is assuming that a Quantum Computer could solve any problem in NP that's not actually NP-complete quickly (or, at least, in polynomial time). That's not known to be true; Quantum Computers would be able to solve some ...



Top 50 recent answers are included