搜索结果: 1-7 共查到“军事学 Identities”相关记录7条 . 查询时间(0.125 秒)
New Approaches to Traitor Tracing with Embedded Identities
traitor tracing public-key cryptography
2019/8/30
In a traitor tracing (TT) system for nn users, every user has his/her own secret key. Content providers can encrypt messages using a public key, and each user can decrypt the ciphertext using his/her ...
Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions
public-key cryptography traitor tracing, revocation
2019/8/30
A traitor tracing scheme is a multi-user public-key encryption scheme where each user in the system holds a decryption key that is associated with the user's identity. Using the public key, a content ...
Decentralized Multi-authority Anonymous Authentication for Global Identities with Non-interactive Proofs
anonymous authentication attribute collusion attack
2019/6/14
We propose a decentralized multi-authority anonymous authentication scheme in which a prover and a verifier are non-interactive. We give two security definitions; resistance against collusion attacks ...
Witness-Indistinguishable Arguments with $\Sigma$-Protocols for Bundled Witness Spaces and its Application to Global Identities
interactive proof sigma protocol witness indistinguishability
2018/8/16
We propose a generic construction of a Σ-protocol of commit-and-prove type, which is an \textsc{and}-composition of Σ-protocols on the statements that include a common commitment. Our protocol enables...
On ``identities'', ``names'', ``NAMES'', ``ROLES'' and Security: A Manifesto
cryptographic protocols
2012/3/28
There is a great deal of confusion in the cryptology literature relating to various identity related issues. By ``names'' (lower case), we are referring to informal, personal ways that we indicate oth...
ON EXPONENTIAL SUMS, NOWTON IDENTITIES AND DICKSON POLYNOMIALS OVER FINITE FIELDS
Nowton identities Dickson Polynomials Finite Fields
2010/2/1
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) ∈ Fq[x] be a polynomial of degree n with gcd(n; q) = 1. We present a recursive formula for evaluating the exponential sum
Σc2Fqs(s)(f(x))...
Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities
Target Collision MD5 Different Identities
2008/12/24
We have shown how, at a cost of about 252 calls to the MD5 compression function,
for any two target messages m1 and m2, values b1 and b2 can be constructed such that
the concatenated values m1kb1 an...