搜索结果: 1-15 共查到“军事学 Composition”相关记录38条 . 查询时间(0.264 秒)
Halo: Recursive Proof Composition without a Trusted Setup
zero knowledge elliptic curve cryptosystem
2019/9/16
Non-interactive proofs of knowledge allow us to publicly demonstrate the faithful execution of arbitrary computations. SNARKs have the additional property of succinctness, meaning that the proofs are ...
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...
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs
zero knowledge implementation zk-SNARKs framework
2019/2/26
We study the problem of building SNARKs modularly by linking small specialized “proof gadgets" SNARKs in a lightweight manner. Our motivation is both theoretical and practical. On the theoretical side...
Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition
Bitcoin blockchain parallel composition
2018/11/21
Two of the most significant challenges in the design of blockchain protocols is increasing their transaction processing throughput and minimising latency in terms of transaction settlement. In this wo...
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More
non-malleable codes non-malleable extractors explicit constructions
2018/11/12
Non-malleable codes were introduced by Dziembowski, Pietrzak, and Wichs (JACM 2018) as a generalization of standard error correcting codes to handle severe forms of tampering on codewords. This notion...
Reconsidering Generic Composition: the Tag-then-Encrypt case
Authenticated Encryption generic composition tag-then-encrypt
2018/11/5
Authenticated Encryption (AEAE) achieves confidentiality and authenticity, the two most fundamental goals of cryptography, in a single scheme. A common strategy to obtain AEAE is to combine a Message ...
Lattice-Based Techniques for Accountable Anonymity: Composition of Abstract Stern’s Protocols and Weak PRF with Efficient Protocols from LWR
Lattice-Based Cryptography Zero-Knowledge Arguments of Knowledge Privacy-Preserving Protocol
2017/8/17
In an accountable anonymous system, a user is guaranteed anonymity and unlinkability unless some well-defined condition is met. A line of research focus on schemes that do not rely on any trusted thir...
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
secure multi-party computation parallel composition broadcast
2017/4/27
An important benchmark for multi-party computation protocols (MPC) is their round complexity. For several important MPC tasks, (tight) lower bounds on the round complexity are known. However, for some...
We will present here two simple theorems that show that when we compose permutation generators with independent keys, then the ``quality'' of CCA security increases. These theorems are written in term...
A Multiplexer based Arbiter PUF Composition with Enhanced Reliability and Security
Arbiter PUF (APUF) APUF compositions modeling attack
2016/12/7
Arbiter Physically Unclonable Function (APUF), while being relatively lightweight, is extremely vulnerable to modeling
attacks. Hence, various compositions of APUFs such as XOR APUF and Lightweight S...
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck
probabilistically checkable proofs interactive proofs proof composition
2016/3/24
We study *interactive oracle proofs* (IOPs) (Ben-Sasson, Chiesa, Spooner '16), which combine aspects of probabilistically checkable proofs (PCPs) and interactive proofs (IPs). We present IOP construct...
Online/Offline OR Composition of Sigma Protocols
Sigma protocols round efficiency adaptive input
2016/2/24
Proofs of partial knowledge allow a prover to prove knowledge of witnesses for k out of n
instances of NP languages. Cramer, Schoenmakers and Damgⅹard [CDS94] provided an efficient
construction of a...
On the Composition of Two-Prover Commitments, and Applications to Multi-Round Relativistic Commitments
bit commitment two provers
2016/2/23
We consider the related notions of two-prover and of relativistic
commitment schemes. In recent work, Lunghi et al. proposed a
new relativistic commitment scheme with a multi-round sustain phase
th...
Universal Composition with Responsive Environments
universal composability protocol design cryptographic security proofs
2016/1/27
A increasingly popular approach to proving the security of protocols is to define the
desired security and functional properties by an ideal functionality and then to prove that a protocol
realizes ...
Reconsidering Generic Composition
authenticated encryption generic composition IV-based encryption
2016/1/25
In the context of authenticated encryption (AE), generic composition has referred to the
construction of an AE scheme by gluing together a conventional (privacy-only) encryption scheme and
a MAC. Si...