搜索结果: 1-15 共查到“constructions”相关记录210条 . 查询时间(0.093 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Integrability and constructions of the peakon systems
peakon系统 可积性 构造 Camassa-Holm方程
2023/11/13
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:On constructions of Lax representations: some examples
松弛表示 构造 非线性数学物理方程 KdV方程
2023/4/24
Subversion-Resistant Commitment Schemes: Definitions and Constructions
Commitment schemes subversion security common reference string model
2019/9/23
A commitment scheme allows a committer to create a commitment to a secret value, and later may open and reveal the secret value in a verifiable manner. In the common reference string model, commitment...
Inclusory constructions in the Māori languages of Aotearoa and the Southern Cook Islands
Cook Islands Māori coordination inclusory constructions Māori Oceanic Linguistics
2019/10/10
This paper discusses Lichtenberk’s notion of inclusory constructions as manifested in two closely related East Polynesian languages of the realm of New Zealand: New Zealand Māori and Cook Islands Māor...
In order to study the resistance of a block cipher against boomerang attacks, a tool called the Boomerang Connectivity Table (BCT) for S-boxes was recently introduced. Very little is known today about...
New Constructions of Hinting PRGs, OWFs with Encryption, and more
number theory one-way functions RSA
2019/8/27
Over the last few years there has been a surge of new cryptographic results, including laconic oblivious transfer, (anonymous/ hierarchical) identity-based encryption, trapdoor functions, chosen-ciphe...
Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems
Information theoretic security key agreement physical unclonable functions
2019/7/8
The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random l...
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness
information theory foundations distributed cryptography
2019/7/8
Consider the representative task of designing a distributed coin-tossing protocol for nn processors such that the probability of heads is X0∈[0,1]X0∈[0,1], and an adversary can reset one processor to ...
Security-Efficiency Tradeoffs in Searchable Encryption -- Lower Bounds and Optimal Constructions
searchable encryption lower bound
2019/6/13
Besides their security, the efficiency of searchable encryption schemes is a major criteria when it comes to their adoption: in order to replace an unencrypted database by a more secure construction, ...
Exploring Constructions of Compact NIZKs from Various Assumptions
non-interactive zero-knowledge pairing homomorphic equivocal commitment
2019/6/4
A non-interactive zero-knowledge (NIZK) protocol allows a prover to non-interactively convince a verifier of the truth of the statement without leaking any other information. In this study, we explore...
Omniring: Scaling Up Private Payments Without Trusted Setup - Formal Foundations and Constructions of Ring Confidential Transactions with Log-size Proofs
Ring Confidential Transactions Log-size Proofs
2019/5/31
Monero is the largest cryptocurrency with built-in cryptographic privacy features. The transactions are authenticated using spend proofs, which provide a certain level of anonymity by hiding the sourc...
New Code-Based Privacy-Preserving Cryptographic Constructions
Code-based cryptography zero-knowledge range arguments
2019/5/21
Code-based cryptography has a long history but did suffer from periods of slow development. The field has recently attracted a lot of attention as one of the major branches of post-quantum cryptograph...
Lattice-based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications
lattice-based cryptography zero-knowledge proof CRT packing, ring signature
2019/5/9
We devise new techniques for design and analysis of efficient lattice-based zero-knowledge proofs (ZKP). First, we introduce one-shot proof techniques for non-linear polynomial relations of degree k≥2...
Backward Private DSSE: Alternative Formulations of Information Leakage and Efficient Constructions
Dynamic Searchable Symmetric Encryption Backward Privacy Forward Privacy
2019/5/9
Dynamic Searchable Symmetric Encryption (DSSEDSSE), apart from providing support for search operation, allows a client to perform update operations on outsourced database efficiently. Two security pro...
Composition of Boolean Functions: An Application to the Secondary Constructions of Bent Functions
Secondary constructions Composition of Boolean functions Bent
2019/4/28
Bent functions are optimal combinatorial objects and have been attracted their research for four decades. Secondary constructions play a central role in constructing bent functions since a complete cl...