[PDF] Top 20 Efficient Post-Quantum Zero-Knowledge and Signatures
Has 10000 "Efficient Post-Quantum Zero-Knowledge and Signatures" found on our website. Below are the top 20 most common "Efficient Post-Quantum Zero-Knowledge and Signatures".
Efficient Post-Quantum Zero-Knowledge and Signatures
... considering quantum algorithms, in theory it may be possible to find collisions using a generic algorithm of Brassard et ...the quantum algorithm is unlikely to outperform the O(2 n/2 ) classical ...against ... See full document
36
Post-quantum verifiable random functions from ring signatures
... RLWE[3] is an algebraic variant of the LWE[4] problem, both known to be reducible to the worst-case shortest vector lattice problem (thus implying re- sistance to polynomial-time quantum algorithms), with RLWE ... See full document
7
Post-Quantum EPID Signatures from Symmetric Primitives
... EPID signatures are used extensively in real-world systems for hardware enclave ...schemes post-quantum ...shorter signatures for many applications, including the use case of remote hardware ... See full document
29
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
... We present six different sets of parameters, depending on the level of security that is required. To compute them, we follow the general methodology from Alkim et al. [ADPS16]. This will give us a wide choice of ... See full document
50
Efficient Signatures of Knowledge and DAA in the Standard Model
... general Zero-Knowledge (ZK) proofs. The first efficient non-interactive ZK proofs without random oracles were introduced by Groth and Sahai [36]; however these proofs only apply to a restricted ... See full document
28
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits
... Adaptive Proof of Security. The bottleneck faced in simulating garbled cir- cuit based protocols for post-execution corruptions usually lies in “explaining” the randomness of the GC constructor once her input is ... See full document
47
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability
... less efficient than ours is that in order to prove that the message is in a small set, the space of the messages and the challenges is restricted to a small-dimensional ...of knowledge has “slack” and ... See full document
37
Generic Double-Authentication Preventing Signatures and a Post-Quantum Instantiation
... Efficient NIZK Proof Systems for General Circuits. Over the last few years NIZK proof systems for general circuits have seen significant progress im- proving their overall efficiency. Based on the MPC-in-the-head ... See full document
23
An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme
... time quantum adversary. This scheme can consequently be considered as post- quantum ...of efficient quantum computers, the schemes must also be post-quantum ...of ... See full document
25
Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
... provide efficient ways of proving knowledge of a discrete logarithm in finite groups with known order, and even with unknown order [14, ...of knowledge are heavily used for authentication but also as ... See full document
13
Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols
... Related Work. Pedersen [41] considers distributed provers in the context of undeniable signatures. However, while our goal is to improve the security against theft of the user’s identity, Pedersen’s focus is on ... See full document
27
Non-interactive zero-knowledge proofs in the quantum random oracle model
... for efficient protocol ...generic quantum-secure construction was known to transform sigma-protocols into NIZK proofs or NIZK proofs of knowledge in the random oracle ... See full document
26
MoL 2018 10: Post quantum Security of Fiat Shamir Signatures
... Alice’s knowledge? Suppose that they want to send a single (video) message to all of their friends, to prove to them that Alice knows the password to the ... See full document
56
Precomputation Methods for Faster and Greener Post-Quantum Cryptography on Emerging Embedded Platforms
... provide efficient public-key based solutions that can thwart ...two post-quantum digital signature schemes: hash-based and lattice-based digital sig- ...to post-quantum cryptography and ... See full document
23
Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
... non-interactive zero-knowledge (NIZK) proofs [11, 10, 22] are among the most fundamental and versatile cryptographic ...of knowledge (PoKs) [29, 5, 20] allow a prover to convince a verifier, who ... See full document
26
Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives
... Our construction basically follows the approach discussed above to reduce sig- nature size. However, in contrast to Dodis et al., besides targeting the post- quantum setting, we (1) do not require a trusted ... See full document
24
Efficient Quantum-Immune Keyless Signatures with Identity
... electronic signatures are compared to illiterate persons signing paper documents in the presence of a notary ...electronic signatures are far more complicated than pens used to sign paper ...limited ... See full document
14
Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof
... of quantum computer and quantum communication, we are forced to study cryptography with quantum security, ...(a.k.a. post-quantum cryptography), but even quantum computer cannot ... See full document
23
Blockchained Post-Quantum Signatures
... our knowledge, this is the first signature scheme that can utilise an existing blockchain or graph structure to reduce the signature cost to one OTS, even when we plan to sign many ... See full document
8
Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge
... is zero-knowledge (the verifier learns only that the statement is true) because the prover verifies that she generates the GC honestly before disclosing any ... See full document
30
Related subjects