搜索结果: 1-9 共查到“军事学 construct”相关记录9条 . 查询时间(0.25 秒)
How to Construct CSIDH on Edwards Curves
Isogeny-based cryptography Montgomery curves Edwards curves
2019/7/22
CSIDH is an isogeny-based key exchange protocol proposed by Castryck, Lange, Martindale, Panny, and Renes in 2018. CSIDH is based on the ideal class group action on FpFp-isomorphic classes of Montgome...
How to Construct a Leakage-Resilient (Stateless) Trusted Party
Leakage-Resilience Secure Multiparty Computation Algebraic Manipulation Detection
2017/9/25
Trusted parties and devices are commonly used in the real world to securely perform computations on secret inputs. However, their security can often be compromised by side-channel attacks in which the...
In this paper, a new way to construct cryptographic hash function is given.
The cryptographic hash function is generalized to uncertain function which has various
specific function forms. When compu...
How to Construct UC-Secure Searchable Symmetric Encryption Scheme
searchable symmetric encryption UC-security symmetric-key encryption
2016/1/3
A searchable symmetric encryption (SSE) scheme allows a client
to store a set of encrypted files on an untrusted server in such a way
that he can efficiently retrieve some of the encrypted files con...
How To Construct Extractable One-Way Functions Against Uniform Adversaries
Extractable Functions Zero-Knowledge
2014/3/11
A function $f$ is extractable if it is possible to algorithmically ``extract,'' from any program that outputs a value $y$ in the image of $f,$ a preimage of $y$. % under $f$. When combined with hardne...
How to Construct an Ideal Cipher from a Small Set of Public Permutations
ideal cipher iterated Even-Mansour cipher
2014/3/13
We show how to construct an ideal cipher with $n$-bit blocks and $n$-bit keys (\emph{i.e.} a set of $2^n$ public $n$-bit permutations) from a small constant number of $n$-bit random public permutation...
How to Construct Cryptosystems and Hash Functions in Weakened Random Oracle Models
Random oracle model variable input length weakened random oracle model fixed input length weakened random oracle model
2009/11/18
In this paper, we discuss how to construct secure cryptosystems and secure hash functions
in weakened random oracle models.
The weakened random oracle model (WROM), which was introduced by Numayama ...
How to Construct Identity-Based Signatures without the Key Escrow Problem?
Construct Identity-Based Signatures Key Escrow Problem
2009/9/2
The inherent key escrow problem is one of the main reasons for the slow adoption
of identity-based cryptography. The existing solution for mitigating the key escrow problem
is by adopting multiple P...
How to Construct Sufficient Condition in Searching Collisions of MD
Construct Sufficient Condition Searching Collisions MD
2008/10/31
In Eurocrypt 2005, Wang et al. presented a collision attak on MD5. In their paper, they intoduced “Sufficient Condition” which would be needed to generate collisions. In this paper, we explain how to ...