搜索结果: 1-12 共查到“军事学 proof systems”相关记录12条 . 查询时间(0.072 秒)
Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations
threshold cryptography two-party ECDSA
font style='font-size:12px;'>
2019/5/21
ECDSA is a widely adopted digital signature standard. Unfortunately, efficient distributed variants of this primitive are notoriously hard to achieve and known solutions often require expensive zero k...
Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems
snark stark bulletproofs
font style='font-size:12px;'>
2019/5/13
The area of practical proof systems, like SNARKs, STARKs, or Bulletproofs, is seeing a very dynamic development. Many use-cases of such systems involve, often as their most expensive apart, proving th...
Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems
snark stark bulletproofs
font style='font-size:12px;'>
2019/5/13
The area of practical proof systems, like SNARKs, STARKs, or Bulletproofs, is seeing a very dynamic development. Many use-cases of such systems involve, often as their most expensive apart, proving th...
New (and Old) Proof Systems for Lattice Problems
lattices (noninteractive) statistical zero knowledge smoothing parameter
font style='font-size:12px;'>
2017/12/25
We continue the study of statistical zero-knowledge (SZK) proofs, both interactive and noninteractive, for computational problems on point lattices. We are particularly interested in the problem GapSP...
Hash Proof Systems over Lattices Revisited
Hash Proof Systems SPHF Lattices
font style='font-size:12px;'>
2017/10/12
Hash Proof Systems or Smooth Projective Hash Functions (SPHFs) are a form of implicit arguments introduced by Cramer and Shoup at Eurocrypt'02. They have found many applications since then, in particu...
Removing Erasures with Explainable Hash Proof Systems
Oblivious Transfer Password Authenticated Key Exchange Erasures
font style='font-size:12px;'>
2016/1/25
An important problem in secure multi-party computation is the design of protocols that can
tolerate adversaries that are capable of corrupting parties dynamically and learning their internal states. ...
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding
Quantum cryptography proofs of knowledge rewinding
font style='font-size:12px;'>
2016/1/23
Quantum zero-knowledge proofs and quantum proofs of knowledge are inherently difficult to analyze because their security analysis uses rewinding. Certain cases of quantum rewinding are handled by th...
Disjunctions for Hash Proof Systems: New Constructions and Applications
Hash Proof System Non-Interactive Zero-Knowledge Proof Group Password Authenticated Key Exchange
font style='font-size:12px;'>
2016/1/9
Hash Proof Systems were first introduced by Cramer and Shoup (Eurocrypt’02) as a
tool to construct efficient chosen-ciphertext-secure encryption schemes. Since then, they have found
many other appli...
Primary-Secondary-Resolver Membership Proof Systems
Zero-Knowledge Efficiency DNSSEC
font style='font-size:12px;'>
2016/1/6
We consider Primary-Secondary-Resolver Membership Proof Systems (PSR for short) and
show different constructions of that primitive. A PSR system is a 3-party protocol, where we have a
primary, which...
Zero-Knowledge Interactive Proof Systems for New Lattice Problems
Zero-Knowledge Interactive Proof Systems Isometric Latties
font style='font-size:12px;'>
2015/12/22
In this work we introduce a new hard problem in lattices called Isometric Lattice Problem (ILP) and reduce Linear Code Equivalence over prime fields and Graph Isomorphism to this prob- lem. We also sh...
CCA-Secure IB-KEM from Identity-Based Extractable Hash Proof Systems
public-key cryptography identity-based extractable hash proof
font style='font-size:12px;'>
2013/2/21
In this paper, we introduce a general paradigm called identity-based extractable hash proof system (IB-EHPS), which is an extension of extractable hash proof system (EHPS) proposed by Wee (CRYPTO ’10)...
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive witness-indistinguishability non-interactive zero-knowledge common reference
font style='font-size:12px;'>
2008/9/1
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have
played a significant role in the theory of cryptography. However, lack of efficiency has prevented them...