搜索结果: 1-11 共查到“军事学 Possibility”相关记录11条 . 查询时间(0.109 秒)
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model
Verifiable Delay Functions Random Oracle Model
2019/6/6
Boneh, Bonneau, B{\"u}nz, and Fisch (CRYPTO 2018) recently introduced the notion of a \emph{verifiable delay function} (VDF). VDFs are functions that take a long \emph{sequential} time TT to compute, ...
Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results
Backdoor Surveillance PRNG with input
2016/6/6
Inspired by the Dual EC DBRG incident, Dodis et al. (Eurocrypt
2015) initiated the formal study of backdoored PRGs, showing
that backdoored PRGs are equivalent to public key encryption schemes,
giv...
On the (im)possibility of receiving security beyond 2^l using an l-bit PRNG: the case of Wang et. al. protocol
RFID EPC-C1-G2 Authentication
2015/12/31
Recently,Wang et al. analyzed the security of two EPC C1-G2 compliant RFID authentication
protocols, called RAPLT and SRP +, and proved that these protocols are vulnerable
against de-synchronization...
On the Possibility of Non-Interactive E-Voting in the Public-key Setting
e-voting bilinear maps secure computation
2015/12/21
In 2010 Hao, Ryan and Zielinski proposed a simple decentralized evoting
protocol that only requires 2 rounds of communication. Thus, for k elections
their protocol needs 2k rounds of communication.
On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses
Tampering Randomness Fourier Analysis Encryption.
2013/4/18
We initiate a study of the security of cryptographic primitives in the presence of efficient tampering attacks to the randomness of honest parties. More precisely, we consider p-tampering attackers th...
On the (Im)possibility of Projecting Property in Prime-Order Setting
Bilinear Groups Projecting (im)possibility Zero-Knowledge Proofs
2013/4/18
Projecting bilinear pairings have frequently been used for designing cryptosystems since they were first derived from composite order bilinear groups. There have been only a few studies on the (im)pos...
White-Box Cryptography: Formal Notions and (Im)possibility Results
White-Box Cryptography Formal Notions WBP
2009/6/5
A key research question in computer security is whether
one can implement software that offers some protection
against software attacks from its execution platform. While
code obfuscation attempts ...
Possibility and impossibility results for selective decommitments
cryptography commitments zero-knowledge
2009/6/3
The selective decommitment problem can be described as follows: assume an adversary re-
ceives a number of commitments and then may request openings of, say, half of them. Do the
unopened commitment...
On the (Im)Possibility of Key Dependent Encryption
Key-dependent input Black-box separations One-way functions
2009/6/3
We study the possibility of constructing encryption schemes secure under messages that are chosen
depending on the key k of the encryption scheme itself. We give the following separation results that...
A Practical Limit of Security Proof in the Ideal Cipher Model : Possibility of Using the Constant As a Trapdoor In Several Double Block Length Hash Functions
Hash Function Collision Attack Block Cipher
2009/1/9
Recently, Shoichi Hirose [2] proposed several double block
length (DBL) hash functions. Each DBL hash function uses a constant
which has a role to make the DBL hash function collision-resistant in
...
On the (Im-)Possibility of Extending Coin Toss.