搜索结果: 1-15 共查到“军事学 U-Prove”相关记录19条 . 查询时间(0.08 秒)
Agree-and-Prove: Generalized Proofs Of Knowledge and Applications
PoK Knowledge and Applications
2019/6/5
Proofs of knowledge (PoK) are one of the most fundamental notions in cryptography and have been used as a building block in numerous applications. The appeal of this notion is that it is parameterized...
My Gadget Just Cares For Me - How NINA Can Prove Security Against Combined Attacks
Combined Security DPA DFA
2019/6/4
In order to thwart Differential Power Analysis (DPA) and Differential Fault Analysis (DFA) attacks, we require the implemented algorithm to ensure correct output and sensitive variable privacy. We pro...
How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs
linear PCPs proof systems zero knowledge
2019/3/1
We introduce and study the notion of fully linear probabilistically checkable proof systems. In such a proof system, the verifier can make a small number of linear queries that apply jointly to the in...
Breaking the Binding: Attacks on the Merkle Approach to Prove Liabilities and its Applications
proof of liabilities Maxwell protocol summation Merkle tree
2018/11/30
Proofs of liabilities are used for applications, function like banks or Bitcoin exchanges, to prove the sums of money in their dataset that they should owe. The Maxwell protocol, a cryptographic proof...
Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove
Secure Channels Ciphertext Fragmentation Universal Composability
2018/11/16
Ever since the foundational work of Goldwasser and Micali, simulation has proven to be a powerful and versatile construct for formulating security in various areas of cryptography. However security de...
Motivatedbytheoreticalandpracticalconsiderations,anim- portant line of research is to design secure computation protocols that only make black-box use of cryptography. An important component in nearly...
How to Prove Megabytes (Per Second)
zero-knowledge witness indistinguishable witness hiding
2017/9/7
We propose the first provably secure zero-knowledge (ZK) argument of knowledge (AoK) protocol running at close to 1 megabyte per second (MBps) on commodity hardware -- about an order of magnitude fast...
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...
Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge
zero knowledge trusted hardware cryptocurrency
2016/6/22
Trusted hardware systems, such as Intel's new SGX instruction set architecture extension, aim to provide strong confidentiality and integrity assurances for applications. Recent work, however, raises ...
How to prove knowledge of small secrets
Proofs of Plaintext Knowledge Lattice-based Encryption Homomorphic Hashing
2016/6/2
We propose a new zero-knowledge protocol applicable to additively homomorphic functions that map integer vectors to an Abelian group. The protocol demonstrates knowledge of a short preimage and achiev...
Practical backward unlinkable revocation in FIDO, German e-ID, Idemix and U-Prove
ABCs electronic authentication backward unlinkable revocation pairings
2016/3/1
FIDO, German e-ID, Idemix and U-Prove constitute privacyenhanced
public-key infrastructures allowing users to authenticate in an
anonymous way. This however hampers timely revocation in a privacy
f...
Zk-SNARKs (succinct non-interactive zero-knowledge arguments
of knowledge) are needed in many applications. Unfortunately,
all previous zk-SNARKs for interesting languages are either inefficient
fo...
TRACING ATTACKS ON U-PROVE WITH REVOCATION MECHANISM
anonymous credential U-Prove revocation
2016/1/4
Anonymous credential systems have to provide strong privacy protection:
a user may prove his (chosen) attributes without leaking
neither his identity nor other attributes. In this paper we consider
...
The self-blindable U-Prove scheme by Hanzlik and Kluczniak is forgeable
anonymous credentials attribute-based credentials
2015/12/24
In [HK14] an unlinkable version of the U-Prove attribute-based credential scheme is proposed.
Unfortunately, the new scheme is forgeable: if sufficiently many users work together then they
can const...
Most computational soundness theorems deal with a limited number of primitives, thereby limiting their applicability. The notion of deduction soundness of Cortier and Warinschi (CCS'11) aims to facili...