Cyber Security
17th China Annual Conference, CNCERT 2020, Bei**g, China, August 12, 2020, Revised Selected Papers
Chapter and Conference Paper
The differential-linear attack, combining the power of the two most effective techniques for symmetric-key cryptanalysis, was proposed by Langford and Hellman at CRYPTO 1994. From the exact formula for evaluat...
Chapter and Conference Paper
We show a \(2^{n/2+o(n)}\) 2 ...
Chapter and Conference Paper
We present passive attacks against CKKS, the homomorphic encryption scheme for arithmetic on approximate numbers presented at Asiacrypt 2017. The attack is both theoretically efficient (running in expected pol...
Chapter and Conference Paper
The Meet-in-the-Middle (MITM) preimage attack is highly effective in breaking the preimage resistance of many hash functions, including but not limited to the full MD5, HAVAL, and Tiger, and reduced SHA-0/1/2. It...
Book and Conference Proceedings
17th China Annual Conference, CNCERT 2020, Bei**g, China, August 12, 2020, Revised Selected Papers
Chapter and Conference Paper
This paper introduces the concept of cyberspace search engine, and makes a deep survey on 5 well-known search engines, say Shodan, Censys, BinaryEdge, ZoomEye and Fofa, by querying official websites, analyzing...
Chapter and Conference Paper
Agriculture 4.0 is the era of integrating intelligent technologies in agriculture. Problems such as low informatization, food safety, high management cost and imbalance between supply and demand in agriculture...
Chapter and Conference Paper
Impossible differentials cryptanalysis and impossible polytopic cryptanalysis are the most effective approaches to estimate the security of block ciphers. However, the previous automatic search methods of thei...
Chapter and Conference Paper
Crowdsourcing is a paradigm that provides a cost-effective solution for obtaining services or data from a large group of users. It is increasingly being used in modern society for data collection in domains su...
Chapter and Conference Paper
Can Alice and Bob agree on a uniformly random secret key without having any truly secret randomness to begin with? Here we consider a setting where Eve can get partial leakage on the internal state of both Ali...
Chapter and Conference Paper
Web-based cryptocurrency mining attacks, also known as cryptojacking, become increasingly popular. A large number of diverse platforms (e.g., Windows, Linux, Android, and iOS) and devices (e.g., PC, smartphone...
Chapter and Conference Paper
We present the first explicit construction of a non-malleable code that can handle tampering functions that are bounded-degree polynomials. Prior to our work, this was only known for degree-1 polynomials (affine ...
Chapter and Conference Paper
We show how to generalize Gama and Nguyen’s slide reduction algorithm [STOC ’08] for solving the approximate Shortest Vector Problem over lattices (SVP) to allow for arbitrary block sizes, rather than just blo...
Chapter and Conference Paper
Non-malleable codes were introduced by Dziembowski, Pietrzak, and Wichs (JACM 2018) as a generalization of standard error correcting codes to handle severe forms of tampering on codewords. This notion has attr...
Chapter and Conference Paper
Updatable encryption (UE) is an attractive primitive, which allows the secret key of the outsourced encrypted data to be updated to a fresh one periodically. Several elegant works exist studying various securi...
Chapter and Conference Paper
The dramatic increase of cryptocurrency price has reshaped the cyber security landscape. Many IoT malwares are created, turning many kinds of infected IoT devices into crypto currency mining machines. Crypto ...
Chapter and Conference Paper
Digital rights management (DRM) has been widely used in digital content protection nowadays and has made a great contribution to the protection of digital content. However, the traditional DRM technology has s...
Chapter and Conference Paper
We investigate anonymous broadcast encryptions (ANOBE) in which a ciphertext hides not only the message but also the target recipients associated with it. Following Libert et al.’s generic construction [PKC, 2012...
Chapter and Conference Paper
Boyen and Li [AsiaCrypt, 2016] proposed the first almost tightly secure lattice identity-based encryption scheme in the standard model. The security of such scheme is proved under learning with errors assumpti...
Chapter and Conference Paper
Mobile application users want to consume location-based services without disclosing their locations and data owners (DO) want to provide different levels of service based on consumer classifications, sometimes...