搜索结果: 1-12 共查到“军事学 Verifying”相关记录12条 . 查询时间(0.109 秒)
Verifying Solutions to LWE with Implications for Concrete Security
lattices learning with errors discrete gaussian sampling
2019/6/21
A key step in Regev's (2009) reduction of the Discrete Gaussian Sampling (DGS) problem to that of solving the Learning With Errors (LWE) problem is a statistical test required for verifying possible s...
A landmark security property of smart contracts is liquidity: in a non-liquid contract, it may happen that some funds remain frozen. The relevance of this issue is witnessed by a recent liquidity atta...
vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases
verifiable computation interactive arguments verifiable database queries
2017/11/28
Cloud database systems such as Amazon RDS or Google Cloud SQL enable the outsourcing of a large database to a server who then responds to SQL queries. A natural problem here is to efficiently verify t...
Mistakes Are Proof That You Are Trying: On Verifying Software Encoding Schemes' Resistance to Fault Injection Attacks
software encoding schemes formal code analysis fault injection attacks
2016/12/8
Software encoding countermeasures are becoming increasingly popular among researchers proposing code-level prevention against data-dependent leakage allowing an attacker to mount a side-channel attack...
Compositional Verification of Higher-Order Masking: Application to a Verifying Masking Compiler
Masking Composition Formal Methods
2015/12/30
The prevailing approach for building masked algorithms that can resist
higher-order differential power analysis is to develop gadgets, that is, masked
gates used as atomic blocks, that securely impl...
When a client outsources a job to a third party (e.g., the cloud), how can the client check the result, without reexecuting the computation? Recent work in _proof-based verifiable computation_ has mad...
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
succinct arguments zero-knowledge
2014/3/10
An argument system for NP is a proof system that allows efficient verification of NP statements, given proofs produced by an untrusted yet computationally-bounded prover. Such a system is non-interact...
We show that for an arbitrary mapping $F$ on $F_2^n$ to verify that it is APN, it is enough to consider the difference mappings of $F$ defined by elements from an hyperplane.
On Verifying Dynamic Multiple Data Copies over Cloud Servers
cryptographic protocols / Cloud computing outsourcing data storage dynamic data integrity cryptographic protocols
2012/3/26
Currently, many individuals and organizations outsource their data to remote cloud service providers (CSPs) seeking to reduce the maintenance cost and the burden of large local data storage. The CSP o...
Forward-Secure Signatures with Optimal Signing and Verifying
Forward-Secure Signatures Optimal Signing Verifying
2009/4/16
We propose the first forward-secure signature scheme for
which both signing and verifying are as efficient as for one of the most
efficient ordinary signature schemes (Guillou-Quisquater [GQ88]), ea...
Better than BiBa: Short One-time Signatures with Fast Signing and Verifying
BiBa Short One-time Signatures Fast Signing
2009/4/13
One-time signature schemes have found numerous applications: in ordinary, on-line/off-line,
and forward-secure signatures. More recently, they have been used in multicast and broadcast
authenticatio...
Verifying Statistical Zero Knowledge with Approximate Implementations
Verifying Statistical Zero Knowledge Approximate Implementations
2008/8/27
Statistical zero-knowledge (SZK) properties play an important
role in designing cryptographic protocols that enforce honest behavior
while maintaining privacy. This paper presents a novel approach
...