搜索结果: 1-15 共查到“军事学 combinatorial”相关记录25条 . 查询时间(0.062 秒)
Efficient Message Authentication Codes with Combinatorial Group Testing
Message authentication code Combinatorial group testing Data corruption
2019/4/23
Message authentication code, MAC for short, is a symmetric-key cryptographic function for authenticity. A standard MAC verification only tells whether the message is valid or invalid, and thus we can ...
An Improved Protocol for Securely Solving the Shortest Path Problem and its Application to Combinatorial Auctions
secure multi-party computation applied cryptography shortest path problem
2017/10/9
We propose a protocol to securely compute the solution to the (single source) Shortest Path Problem, based on Dijkstra's algorithm and Secure Multiparty Computation. Our protocol improves state of the...
Optimal Ramp Schemes and Related Combinatorial Objects
secret sharing combinatorial cryptography
2017/5/23
In 1996, Jackson and Martin proved that a strong ideal ramp scheme is equivalent to an orthogonal array. However, there was no good characterization of ideal ramp schemes that are not strong. Here we ...
Combinatorial Subset Difference Public Key Broadcast Encryption Scheme for Secure Multicast
broadcast encryption secure multicast wildcard
2017/5/15
Public key broadcast encryption is a cryptographic method to securely transmit a message from anyone to a group of receivers such that only privileged users can decrypt it. A secure multicast system a...
A Methodology for the Characterisation of Leakages in Combinatorial Logic
side-channel analysis hardware countermeasures glitches
2016/12/10
Glitches represent a great danger for hardware implementations of cryptographic schemes. Their intrinsic random nature makes them difficult to tackle and their occurrence threatens side-channel protec...
In this paper, we consider methods whereby a subset of players in a (k,n)(k,n)-threshold scheme can ``repair'' another player's share in the event that their share has been lost or corrupted. This wil...
Practical approaches to varying network size in combinatorial key predistribution schemes
combinatorial cryptography key distribution
2014/3/10
Combinatorial key predistribution schemes can provide a practical solution to the problem of distributing symmetric keys to the nodes of a wireless sensor network. Such schemes often inherently suit n...
On a generalized combinatorial conjecture involving addition $\mod 2^k - 1$
foundations / combinatorics addition boolean functions
2012/3/27
In this note, we give a simple proof of the combinatorial conjecture proposed by Tang, Carlet and Tang, based on which they constructed two classes of Boolean functions with many good cryptographic pr...
A Unified Approach to Combinatorial Key Predistribution Schemes for Sensor Networks
cryptographic protocols / key distribution protocols
2012/3/29
There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes. Many of these schem...
Extended Combinatorial Constructions for Peer-to-peer User-Private Information Retrieval
applications
2012/8/28
We consider user-private information retrieval (UPIR), an interesting alternative to private information retrieval (PIR) introduced by Domingo-Ferrer et al. In UPIR, the database knows which records h...
Extended Combinatorial Constructions for Peer-to-peer User-Private Information Retrieval
applications
2012/6/14
We consider user-private information retrieval (UPIR), an interesting alternative to private information retrieval (PIR) introduced by Domingo-Ferrer et al. In UPIR, the database knows which records h...
Extended Combinatorial Constructions for Peer-to-peer User-Private Information Retrieval
applications
2012/3/20
We consider user-private information retrieval (UPIR), an interesting alternative to private information retrieval (PIR) introduced by Domingo-Ferrer et al. In UPIR, the database knows which records h...
Robust parent-identifying codes and combinatorial arrays
Combinatorial cryptography fingerprinting traitor tracing
2012/3/28
An $n$-word $y$ over a finite alphabet of cardinality $q$ is called a descendant of a set of $t$ words $x^1,\dots,x^t$ if $y_i\in\{x^1_i,\dots,x^t_i\}$ for all $i=1,\dots,n.$ A code $\cC=\{x^1,\dots,x...
Robust parent-identifying codes and combinatorial arrays
Combinatorial cryptography fingerprinting traitor tracing
2011/6/8
An $n$-word $y$ over a finite alphabet of cardinality $q$ is called a descendant of a set of $t$ words $x^1,\dots,x^t$ if $y_i\in\{x^1_i,\dots,x^t_i\}$ for all $i=1,\dots,n.$ A code $\cC=\{x^1,\dots,x...
A Unified Approach to Combinatorial Key Predistribution Schemes for Sensor Networks
Combinatorial Key Predistribution Schemes Sensor Networks
2011/2/23
There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes. Many of these schem...
