搜索结果: 1-15 共查到“军事学 Space”相关记录47条 . 查询时间(0.437 秒)
Faster Bootstrapping of FHE over the integers with large prime message space
Fully homomorphic encryption Bootstrapping Restricted depth-3 circuit
<
2019/5/27
Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space
Non-Malleable Codes Proofs of Space Tamper-resilience
<
2019/5/24
Non-malleable codes are encoding schemes that provide protections against various classes of tampering attacks. Recently Faust et al. (CRYPTO 2017) initiated the study of space- bounded non-malleable ...
Anomalies and Vector Space Search: Tools for S-Box Reverse-Engineering
Reverse-engineering Vector space search BCT
<
2019/5/21
S-boxes are functions with an input so small that the simplest way to specify them is their lookup table (LUT). Unfortunately, some algorithm designers exploit this fact to avoid providing the algorit...
Delegating Computations with (almost) Minimal Time and Space Overhead
Delegation schemes argument no-signaling proofs
<
2018/11/14
The problem of verifiable delegation of computation considers a setting in which a client wishes to outsource an expensive computation to a powerful, but untrusted, server. Since the client does not t...
Space Efficient Computational Multi-Secret Sharing and Its Applications
multi-secret sharing fair MPC dynamic threshold
<
2018/11/2
In a (t_1,...,t_l)-multi-secret sharing scheme (MSSS), l independent secrets s_1,...,s_l are shared with n parties in such a way that at least t_i parties are required to recover the secret s_i (while...
Tight proofs of space are necessary for proof-of-replication (PoRep), which is a publicly verifiable proof that the prover is dedicating unique resources to storing one or more retrievable replicas of...
PoReps: Proofs of Space on Useful Data
proofs of storage proofs of space proofs of retrievability
<
2018/7/17
A proof-of-replication (PoRep) is an interactive proof system in which a prover defends a publicly verifiable claim that it is dedicating unique resources to storing one or more retrievable replicas o...
Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis
Post-quantum cryptography (PQC) Circuit model Grover
<
2018/5/22
Performance of cryptanalytic quantum search algorithms is mainly inferred from query complexity which hides overhead induced by an implementation. To shed light on quantitative complexity analysis rem...
Proofs of space (PoS) [DFKP15] are proof systems where a prover can convince a verifier that he ``wastes" disk space. PoS were introduced as a more ecological and economical replacement for proofs of ...
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling
memory-hard functions pebbling space-time trade-offs
<
2018/3/5
Pebble games were originally formulated to study time-space tradeoffs in computation, modeled by games played on directed acyclic graphs (DAGs). Close connections between pebbling and cryptography hav...
Sustained Space Complexity
Memory Hard Functions Depth-Robust Graph Sustained Space Complexity
<
2018/2/9
Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not ...
Non-Interactive Delegation for Low-Space Non-Deterministic Computation
delegation non-interactive succinct arguments
<
2018/1/2
Our scheme consists of only two messages and has adaptive soundness, assuming the existence of a sub-exponentially secure private information retrieval (PIR) scheme, which can be instantiated under st...
During the past few years, adversaries of the United States have begun to use their militaries to test U.S. resolve through innovative methods designed to bypass deterrent threats and avoid direct cha...
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
non-malleable codes streaming
<
2017/11/3
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm ...
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space
Time-Memory Trade-Offs Proofs of Space Proofs of Work
<
2017/9/18
Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather ...