搜索结果: 1-15 共查到“Constructing”相关记录169条 . 查询时间(0.156 秒)
中国科学院南京土壤研究所专利：Method for constructing groundwater monitoring well inside PRB wall
南京土壤研究所 专利 PRB 墙内地下水 监测井 施工方法
2023/4/12
中国科学院南京土壤研究所专利：Method for constructing groundwater monitoring well inside PRB wall。
A New Approach to Constructing Digital Signature Schemes (Extended Paper)
digital signatures hash functions public-key cryptography
2019/6/10
A new hash-based, server-supported digital signature scheme was proposed recently. We decompose the concept into forward-resistant tags and a generic cryptographic time-stamping service. Based on the ...
Constructing Low-latency Involutory MDS Matrices with Lightweight Circuit
Lightweight cryptography MDS matrix Involutory matrix
2019/2/27
MDS matrices are important building blocks providing diffusion functionality for the design of many symmetric-key primitives. In recent years, continuous efforts are made on the construction of MDS ma...
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF
DbHtS Beyond Birthday Cover-free
2018/11/20
SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB) secure block cipher based deterministic MAC. After this work, some more BBB secure deterministic MACs have been proposed, namely...
Understanding and Constructing AKE via Double-key Key Encapsulation Mechanism
Authenticated Key Exchange CK Model Key Encapsulation Mechanism
2018/11/19
Motivated by abstracting the common idea behind several implicitly authenticated key exchange (AKE) protocols, we introduce a primitive that we call double-key key encapsulation mechanism (2-key KEM)....
Constructing Ideal Secret Sharing Schemes based on Chinese Remainder Theorem
Threshold Secret Sharing Chinese Remainder Theorem Polynomial Ring
2018/11/16
Since (t,n)(t,n)-threshold secret sharing (SS) was initially proposed by Shamir and Blakley separately in 1979, it has been widely used in many aspects. Later on, Asmuth and Bloom presented a (t,n)(t,...
Note on Constructing Constrained PRFs from OWFs with Constant Collusion Resistance
Constrained PRF collusion-resistance one-way functions
2018/11/8
Constrained pseudorandom functions (CPRFs) are a type of PRFs that allows one to derive a constrained key KCKC from the master key KK. While the master key KK allows one to evaluate on any input as a ...
Constructing TI-friendly Substitution Boxes using Shift-Invariant Permutations
Shift-invariant Threshold implementation Sbox
2018/11/7
The threat posed by side channels requires ciphers that can be efficiently protected in both software and hardware against such attacks. In this paper, we proposed a novel Sbox construction based on i...
Constructing Infinite Families of Low Differential Uniformity $(n,m)$-Functions with $m>n/2$
APN function Differential Uniformity Nyberg's bound
2018/11/2
Little theoretical work has been done on (n,m)(n,m)-functions when n2nn2ough these functions can be used in Feistel ciphers, and actually play an important role in several block cipher...
Constructing APN functions through isotopic shifts
Boolean function APN isotopic equivalence
2018/8/28
Almost perfect nonlinear (APN) functions over fields of characteristic 2 play an important role in cryptography, coding theory and, more generally, information theory as well as mathematics. Building ...
Constructing Witness PRF and Offline Witness Encryption Without Multilinear Maps
Witness PRF Offline Witness Encryption Randomized Encoding
2018/6/13
Witness pseudorandom functions (witness PRFs), introduced by Zhandry [Zha16], was defined for an NP language L and generate a pseudorandom value for any instance x. The same pseudorandom value can be ...
Constructing low-weight dth-order correlation-immune Boolean functions through the Fourier-Hadamard transform
Correlation-immune Fourier-Hadamard transform Low Hamming weight
2018/1/27
The correlation immunity of Boolean functions is a property related to cryptography, to error correcting codes, to orthogonal arrays (in combinatorics, which was also a domain of interest of S. Golomb...
A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models
secure computation black-box constructions
2017/9/28
We present a unified framework for obtaining black-box constructions of Universal Composable (UC) protocol in trusted setup models. Our result is analogous to the unified framework of Lin, Pass, and V...
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority
cryptographic protocols Honest-Majority
2017/9/1
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output. The security properties of the protocol must be pre...
A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK
SNARKs zero-knowledge cryptocurrencies
2017/6/26
Recent efficient constructions of zero-knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs), require a setup phase in which a common-reference string (CRS) with a certain structure is...