搜索结果: 1-6 共查到“军队指挥学 expander graphs”相关记录6条 . 查询时间(0.04 秒)
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.
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 ...
Efficient Robust Secret Sharing from Expander Graphs
Robust Secret Sharing Expander Graphs Secure Message Transmission
2016/7/29
Threshold secret sharing is a protocol that allows a dealer to share a secret among nn players so that any coalition of tt players learns nothing about the secret, but any t+1t+1 players can reconstru...
Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs
secret-key cryptography
2014/3/5
We develop new schemes for deterministically updating a stored cryptographic key that provide security against an internal adversary who can control the update computation and leak bounded amounts of ...
On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks
cryptographic protocols / Wireless sensor networks key management key predistribution expander graphs
2012/3/23
Providing security for a wireless sensor network composed of small sensor nodes with limited battery power and memory can be a non-trivial task. A variety of key predistribution schemes have been prop...
Cryptographic hash functions from expander graphs
Cryptographic hash functions expander graphs
2008/10/22
We propose constructing provable collision resistant hash
functions from expander graphs. As examples, we investigate two specific
families of optimal expander graphs for provable hash function cons...