搜索结果: 1-15 共查到“军事学 Fiat-Shamir”相关记录20条 . 查询时间(0.101 秒)
Security of Hedged Fiat-Shamir Signatures under Fault Attacks
signature schemes fault attacks Fiat-Shamir signatures
2019/8/22
Deterministic generation of per-signature randomness has been a widely accepted solution to mitigate the catastrophic risk of randomness failure in Fiat-Shamir type signature schemes. However, recent ...
On Security of Fiat-Shamir Signatures over Lattice in the Presence of Randomness Leakage
Randomness leakage attacks Fiat-Shamir signature Dilithium
2019/6/19
Leakage during the signing process, including partial key exposure and partial (or complete) randomness leakage, may be devastating for the security of digital signatures. In this work, we consider th...
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir
TFNP PPAD Nash Equilibrium
2019/5/23
The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s tra...
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
Fiat-Shamir post-quantum digital signatures
2019/3/1
The famous Fiat-Shamir transformation turns any public-coin three-round interactive proof, i.e., any so-called sigma-protocol, into a non-interactive proof in the random-oracle model. We study this tr...
A succinct publicly verifiable non-interactive argument system for log-space uniform NC computations, under the assumption that any one of a broad class of fully homomorphic encryption (FHE) schemes h...
The Fiat-Shamir Zoo: Relating the Security of Different Signature Variants
public-key cryptography Different Signature Variants
2018/8/28
The Fiat-Shamir paradigm encompasses many different ways of turning a given identification scheme into a signature scheme. Security proofs pertain sometimes to one variant, sometimes to another. We sy...
A hash function family is called correlation intractable if for all sparse relations, it is hard to find, given a random function from the family, an input-output pair that satisfies the relation (Can...
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
Fiat-Shamir Quantum Random Oracle Tightness
2017/9/25
The Fiat-Shamir transform is a technique for combining a hash function and an identification scheme to produce a digital signature scheme. The resulting scheme is known to be secure in the random orac...
Post-Quantum Security of Fiat-Shamir
quantum cryptography zero knowledge digital signatures
2017/5/11
The Fiat-Shamir construction (Crypto 1986) is an efficient transformation in the random oracle model for creating non-interactive proof systems and signatures from sigma-protocols. In classical crypto...
How not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
fiat-shamir zero-knowledge random oracle model
2016/12/10
This paper is concerned with two variants of the transformation that appear but have not been clearly delineated in existing literature. Both variants start with the prover making a commitment. The st...
The increased popularity of lightweight implementations invigorates the interest
in the resource-preserving protocols of the late 1980s initially designed for smartcards.
By then, cryptoprocessors w...
Loop abort Faults on Lattice-Based Fiat-Shamir & Hash’n Sign signatures
Fault Attacks Digital Signatures Postquantum Cryptography
2016/5/9
As the advent of general-purpose quantum computers appears to be drawing closer, agencies and advisory bodies have started recommending that we prepare the transition away from factoring and discrete ...
Fiat-Shamir for Highly Sound Protocols is Instantiable
Fiat-Shamir transform non-interactive zero-knowledge signature schemes
2016/3/23
The Fiat-Shamir (FS) transformation (Fiat and Shamir, Crypto '86) is a popular paradigm for constructing very efficient non-interactive zero-knowledge (NIZK) arguments and signature schemes using a ha...
From Obfuscation to the Security of Fiat-Shamir for Proofs
Fiat-Shamir Obfuscation Interactive Proofs
2016/3/18
The Fiat-Shamir paradigm [CRYPTO’86] is a heuristic for converting three-round identification
schemes into signature schemes, and more generally, for collapsing rounds in constant-round
public-coin ...
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
NIZK Fiat-Shamir Transform NPRO
2015/12/24
The Fiat-Shamir (FS) transform is a popular technique for obtaining practical zero-knowledge argument systems. The FS transform uses a hash function to generate, without any further overhead, non-inte...