搜索结果: 1-15 共查到“军事学 soundness”相关记录21条 . 查询时间(0.078 秒)
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
Lattice Zero-Knowledge Argument
font style='font-size:12px;'>
2019/6/26
We provide new zero-knowledge argument of knowledge systems that work directly for a wide class of language, namely, ones involving the satisfiability of matrix-vector relations and integer relations ...
DEEP-FRI: Sampling Outside the Box Improves Soundness
STARK IOP Interactive Proofs
font style='font-size:12px;'>
2019/4/3
Motivated by the quest for scalable and succinct zero knowledge arguments, we revisit worst-case-to-average-case reductions for linear spaces, raised by [Rothblum, Vadhan, Wigderson, STOC 2013]. The p...
Context-Restricted Indifferentiability: Generalizing UCE and Implications on the Soundness of Hash-Function Constructions
Indifferentiability UCE hash functions
font style='font-size:12px;'>
2017/5/27
Understanding how hash functions can be used in a sound manner within cryptographic protocols, as well as how they can be constructed in a sound manner from compression functions, are two important pr...
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
zero-knowledge protocols proofs of knowledge
font style='font-size:12px;'>
2016/7/13
We propose a new zero-knowledge protocol for proving knowledge of short preimages under additively homomorphic functions that map integer vectors to an Abelian group. The protocol achieves amortized e...
Dual-System Simulation-Soundness with Applications to UC-PAKE and More
Dual-System Simulation-Soundness two-tier proof system
font style='font-size:12px;'>
2016/1/6
We introduce a novel concept of dual-system simulation-sound non-interactive zero-knowledge
(NIZK) proofs. Dual-system NIZK proof system can be seen as a two-tier proof system. As opposed
to the usu...
Delegating RAM Computations with Adaptive Soundness and Privacy
delegation RAM computation adaptive security security lifting
font style='font-size:12px;'>
2015/12/21
We consider the problem of delegating RAM computations over persistent databases:
A user wishes to delegate a sequence of computations over a database to a server, where
each compuation may read and...
Practical Dual-Receiver Encryption---Soundness, Complete Non-Malleability, and Applications
Dual receiver encryption soundness
font style='font-size:12px;'>
2014/3/5
We reformalize and recast dual-receiver encryption (DRE) proposed in CCS '04, a public-key encryption (PKE) scheme for encrypting to two independent recipients in one shot. We start by defining the cr...
Deduction Soundness: Prove One, Get Five for Free
computational soundness composability
font style='font-size:12px;'>
2014/3/11
Most computational soundness theorems deal with a limited number of primitives, thereby limiting their applicability. The notion of deduction soundness of Cortier and Warinschi (CCS'11) aims to facili...
Termination-Insensitive Computational Indistinguishability (and applications to computational soundness)
computational indistinguishability non-termination computational soundness
font style='font-size:12px;'>
2010/10/11
We defined a new notion of computational indistinguishability: termination-insensitive computational indistinguishability (tic-indistinguishability). Tic-indistinguishability models indistinguishabili...
Computational Soundness about Formal Encryption in Presence of Secret Shares and Key Cycles
key cycles secret sharing computational soundness
font style='font-size:12px;'>
2010/9/9
The computational soundness of formal encryption is researched extensively after the work by Abadi and Rogaway. A recent work by Abadi and Warinschi extends this work to a scenario in which secret sha...
Computational Soundness for Key Exchange Protocols with Symmetric Encryption
Computational Soundness Key Exchange Protocols Symmetric Encryption
font style='font-size:12px;'>
2009/8/18
Formal analysis of security protocols based on symbolic models has
been very successful in finding
aws in published protocols and prov-
ing protocols secure, using automated tools. An important qu...
Computational soundness, co-induction, and encryption cycles
Computational soundness co-induction greatest fix-points
font style='font-size:12px;'>
2009/6/15
We analyze the relation between induction, co-induction and the presence of encryption cycles in the
context of computationally sound symbolic equivalence of cryptographic expressions. Our main findi...
CoSP: A general framework for computational soundness proofs– or –The computational soundness of the applied pi-calculus
CoSP computational soundness applied pi-calculus
font style='font-size:12px;'>
2009/6/11
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic
models and for embedding these proofs into formal calculi. CoSP considers arbitrary equational
theorie...
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers
Computational Soundness Symbolic Zero-Knowledge Proofs Active Attackers
font style='font-size:12px;'>
2009/6/3
The abstraction of cryptographic operations by term algebras,
called Dolev-Yao models, is essential in almost all
tool-supported methods for proving security protocols. Recently
significant progres...
New Notions of Soundness and Simultaneous Resettability in the Public-Key Model
rZK arguments PRF
font style='font-size:12px;'>
2009/4/16
In this paper, some new notions of soundness in public-key model are presented. We clarify the relationships among our new notions of soundness and the original 4 soundness notions presented by Micali...