搜索结果: 1-15 共查到“知识库 Graphs”相关记录398条 . 查询时间(0.091 秒)
Expander Graphs are Non-Malleable Codes
Non-malleable code Split-state Explicit Constructions
2018/11/8
Any dd-regular graph on nn vertices with spectral expansion λλ satisfying n=Ω(d3log(d)/λ)n=Ω(d3log(d)/λ) yields a O(λ3/2d)O(λ3/2d)-non-malleable code in the split-state model.
Generating Graphs Packed with Paths
Linear cryptanalysis Differential cryptanalysis Linear Approximations
2018/8/21
When designing a new symmetric-key primitive, the designer must show resistance to know attacks. Perhaps most prominent amongst these are linear and differential cryptanalysis. However, it is notoriou...
Ramanujan graphs in cryptography
Post-Quantum Cryptography supersingular isogeny graphs Ramanujan graphs
2018/6/13
In this paper we study the security of a proposal for Post-Quantum Cryptography from both a number theoretic and cryptographic perspective. Charles-Goren-Lauter in 2006 proposed two hash functions bas...
Towards practical key exchange from ordinary isogeny graphs
post-quantum cryptography key exchange elliptic curves
2018/5/28
We revisit the ordinary isogeny-graph based cryptosystems of Couveignes and Rostovtsev–Stolbunov, long dismissed as impractical. We give algorithmic improvements that accelerate key exchange in this f...
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions
Functional graph Hash-based MAC Hash combiner
2018/5/2
We look into attacks involving iteratively evaluating identical mappings many times. The functional graph of a random mapping also involves iteratively evaluating the mapping. These attacks essentiall...
Supersingular isogeny graphs and endomorphism rings: reductions and solutions
post-quantum cryptography isogeny-based cryptography cryptanalysis
2018/4/26
In this paper, we study several related computational problems for supersingular elliptic curves, their isogeny graphs, and their endomorphism rings. We prove reductions between the problem of path fi...
ON ISOGENY GRAPHS OF SUPERSINGULAR ELLIPTIC CURVES OVER FINITE FIELDS
foundations Supersingular isogeny graphs
2018/2/8
We study the isogeny graphs of supersingular elliptic curves over finite fields, with an emphasis on the vertices corresponding to elliptic curves of jj-invariant 0 and 1728.
Faster Cryptographic Hash Function From Supersingular Isogeny Graphs
Cryptographic hash functions Supersingular elliptic curves Isogeny graphs
2017/12/19
Faster Cryptographic Hash Function From Supersingular Isogeny Graphs.
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...
Forward-Secure Searchable Encryption on Labeled Bipartite Graphs
cryptographic protocols DSSE
2017/7/6
Forward privacy is a trending security notion of dynamic searchable symmetric encryption (DSSE). It guarantees the privacy of newly added data against the server who has knowledge of previous queries....
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...
Topology-Hiding Computation on all Graphs
topology-hiding topology-hiding computation broadcast
2017/4/5
A distributed computation in which nodes are connected by a partial communication graph is called topology-hiding if it does not reveal information about the graph beyond what is revealed by the outpu...
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem
Isogeny expander graph hyperelliptic curve cryptography
2017/2/20
Fix an ordinary abelian variety defined over a finite field. The ideal class group of its endomorphism ring acts freely on the set of isogenous varieties with same endomorphism ring, by complex multip...
Novel differentially private mechanisms for graphs
anonymity applications information theory
2016/12/12
In this paper, we introduce new methods for releasing differentially private graphs. Our techniques are based on a new way to distribute noise among edges weights. More precisely, we rely on the addit...
Fast Pseudorandom Functions Based on Expander Graphs
foundations pseudo-random functions Goldreich's OWF
2016/12/10
Our proofs are based on a new search-to-decision reduction for expander-based functions. This extends a previous reduction of the first author (STOC 2012) which was applicable for the special case of ...