搜索结果: 1-15 共查到“军事学 Impossibility”相关记录37条 . 查询时间(0.078 秒)
In this note, we show that a strong notion of KDM security cannot be obtained by any encryption scheme in the auxiliary input setting, assuming Learning With Errors (LWE) and one-way permutations. The...
Enhancements Are Blackbox Non-Trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations
Black-box separations Enhanced Trapdoor Permutations Trapdoor Permutations
2018/11/9
Trapdoor permutations (TDP) are a fundamental primitive in cryptography. Over the years, several variants of this notion have emerged as a result of various applications. However, it is not clear whet...
Impossibility on Tamper-Resilient Cryptography with Uniqueness Properties
black-box separation simulatable attack tamper-resilience
2018/6/5
In this work, we show negative results on the tamper-resilience of a wide class of cryptographic primitives with uniqueness properties, such as unique signatures, verifiable random functions, signatur...
Impossibility of Order-Revealing Encryption in Idealized Models
Black-box separations Order-revealing encryption Random oracle
2017/10/16
An Order-Revealing Encryption (ORE) scheme gives a public procedure by which two ciphertext can be compared to reveal the order of their underlying plaintexts. The ideal security notion for ORE is tha...
Overcoming Cryptographic Impossibility Results using Blockchains
Blockchain Bitcoin Ethereum
2017/9/26
Blockchain technology has the potential to disrupt how cryptography is done. In this work, we propose to view blockchains as an "enabler", much like indistinguishability obfuscation (Barak et al., CRY...
On the impossibility of entropy reversal, and its application to zero-knowledge proofs
statistical zero-knowledge proof entropy reversal black-box reduction
2017/9/25
Zero knowledge proof systems have been widely studied in cryptography. In the statistical setting, two classes of proof systems studied are Statistical Zero Knowledge (SZK) and Non-Interactive Statist...
Suppose nn parties have respective inputs x1,…,xn∈Gx1,…,xn∈G, where GG is a finite group. The parties would like to privately compute x1x2⋯xnx1x2⋯xn (where multiplication refers to the gro...
The pseudorandom-function oracle-Diffie–Hellman (PRF-ODH) assumption has been introduced recently to analyze a variety of DH-based key exchange protocols, including TLS 1.2 and the TLS 1.3 candidates,...
Impossibility of Simulation Secure Functional Encryption Even with Random Oracles
functional encryption simulation-based security random oracle model
2016/12/8
In this work we study the feasibility of achieving simulation security in functional encryption (FE) in the
random oracle model. Our main result is negative in that we give a functionality for which ...
On the Impossibility of Merkle Merge Homomorphism
hash functions digital signature homomorphism
2016/6/17
This work considers a theoretic problem of merging the digests of two ordered lists “homomorphically.” This theoretic problem has potential applications to efficient and verifiable data outsourcing, w...
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...
General Impossibility of Group Homomorphic Encryption in the Quantum World
Homomorphic Encryption Semantic Security Quantum Algorithms
2016/1/26
Group homomorphic encryption represents one of the most
important building blocks in modern cryptography. It forms the basis of
widely-used, more sophisticated primitives, such as CCA2-secure encryp...
Impossibility of Black-Box Simulation Against Leakage Attacks
zero knowledge MPC resettability
2016/1/6
In this work, we show how to use the positive results on succinct argument systems to
prove impossibility results on leakage-resilient black-box zero knowledge. This recently proposed
notion of zero...
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
obfuscation zero-knowledge resettable-security
2015/12/31
The introduction of a non-black-box simulation technique by Barak (FOCS 2001) has been a major landmark in cryptography, breaking the previous barriers of black-box impossibility. Barak's technique ha...
On the Impossibility of Tight Cryptographic Reductions
tight security impossibility meta-reduction
2015/12/31
The existence of tight reductions in cryptographic security proofs is an
important question, motivated by the theoretical search for cryptosystems whose
security guarantees are truly independent of ...