搜索结果: 1-15 共查到“军事学 On Hard”相关记录34条 . 查询时间(0.125 秒)
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland
TFNP round-collapse average-case hardness
2019/6/26
This result follows from a more general theory of interactive average-case complexity, and in particular, a novel round-collapse theorem for computationally-sound protocols, analogous to Babai-Moran's...
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions
Memory Hard Function Depth-Robust Graph Sustained Space Complexity
2018/11/7
Data-Independent Memory-hard functions (iMHFs) are a key cryptographic primitive underlying the design of moderately expensive password hashing algorithms and egalitarian proofs of work that are resis...
Strongly Unforgeable Signatures Resilient to Polynomially Hard-to-Invert Leakage under Standard Assumptions
Digital signature Strong existential unforgeability Leakage-resilience
2018/11/2
A signature scheme is said to be weakly unforgeable, if it is hard to forge a signature on a message not signed before. A signature scheme is said to be strongly unforgeable, if it is hard to forge a ...
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...
Bandwidth-Hard Functions: Reductions and Lower Bounds
Cryptanalysis Hash Functions Bandwidth-Hard Functions
2018/3/5
Memory Hard Functions (MHFs) have been proposed as an answer to the growing inequality between the computational speed of general purpose CPUs and Application Specific Integrated Circuits (ASICs). MHF...
Hard and easy problems for supersingular isogeny graphs
isogeny-based cryptography cryptanalysis
2017/10/9
We consider the endomorphism ring computation problem for supersingular elliptic curves, constructive versions of Deuring's correspondence, and the security of Charles-Goren-Lauter's cryptographic has...
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions
Memory Hard Function Password Hashing Data-Independence
2017/5/25
Essentially all iMHFs can be viewed as some mode of operation (making nn calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial propert...
Symmetrically and Asymmetrically Hard Cryptography
white-box cryptography memory hardness big-key encryption
2017/5/15
The main efficiency metrics for a cryptographic primitive are its speed, its code size and its memory complexity. For a variety of reasons, many algorithms have been proposed that, instead of optimizi...
Cryptographic hash functions have wide applications including password hashing, pricing functions for spam and denial-of-service countermeasures and proof of work in cryptocurrencies. Recent progress ...
In this paper, we explore an idea of making (proof-of-work) blockchains mutable. We propose and implement μμchain, a mutable blockchain, that enables modifications of blockchain history. Blockchains a...
Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evalu...
Towards Sound Fresh Re-Keying with Hard (Physical) Learning Problems
Stefan Dziembowski Sebastian Faust Gottfried Herold
2016/6/6
Most leakage-resilient cryptographic constructions aim at limiting the information adversaries can obtain about secret keys. In the case of asymmetric algorithms, this is usually obtained by secret sh...
Efficiently Computing Data-Independent Memory-Hard Functions
Memory Hard Function Password Hashing Depth-Robust Graph
2016/2/23
A memory-hard function (MHF) f is equipped with a {\em space cost} σ and {\em time cost} τ parameter such that repeatedly computing fσ,τ on an application specific integrated circuit (ASIC) is not eco...
Balloon Hashing: Provably Space-Hard Hash Functions with Data-Independent Access Patterns
hash functions password hashing passwords
2016/1/27
We present the Balloon family of password
hashing functions. These are the first cryptographic
hash functions with proven space-hardness
properties that: (i) use a password-independent access
patt...
Pseudorandom Generator Based on Hard Lattice Problem
hard lattice problems pseudorandom generator
2016/1/26
We use a variation of the classical hard problem \emph{Inhomogeneous Small Integer Solution} ISIS of lattice, say \emph{Inhomogeneous Subset Sum Solution} ISSS. ISSS itself is a hash function. Proving...