A5005015823- Cryptography and Data Security
- Cryptographic Implementations and Security
- Coding theory and cryptography
- Complexity and Algorithms in Graphs
- Privacy-Preserving Technologies in Data
- Blockchain Technology Applications and Security
- Chaos-based Image/Signal Encryption
- Wireless Communication Security Techniques
- Distributed systems and fault tolerance
- Advanced Authentication Protocols Security
- User Authentication and Security Systems
- Cloud Data Security Solutions
- Algebraic Geometry and Number Theory
- Security and Verification in Computing
- Internet Traffic Analysis and Secure E-voting
- Advanced Malware Detection Techniques
- Cryptography and Residue Arithmetic
- Parallel Computing and Optimization Techniques
- graph theory and CDMA systems
- Advanced Algebra and Geometry
- Interconnection Networks and Systems
- Vehicular Ad Hoc Networks (VANETs)
- Smart Grid Security and Resilience
- DNA and Biological Computing
Shandong University
2013-2024
Shandong University of Science and Technology
2019-2024
Peng Cheng Laboratory
2023-2024
State Key Laboratory of Cryptology
2008-2024
Proof-of-work (PoW) blockchain protocols based on directed acyclic graphs (DAGs) have demonstrated superior transaction confirmation performance compared to their chainbased predecessors.However, it is uncertain whether security deteriorates in high-throughput settings similar predecessors, because acceptance of simultaneous blocks and complex block dependencies presents challenges for rigorous analysis.We address these by analyzing DAG-based via a congestible model (CBM), general that...
We provide a strong security notion for broadcast encryption, called adaptive in the multichallenge setting (MA-security), where adversary can adaptively have access to key generation oracle and encryption many times (multichallenge). The specially query challenge ciphertexts on different target user sets adaptively, which generalizes attacks against encryptions real world setting. Our general result shows that reduction of secure will lose factor <mml:math...
This paper investigates public key encryption that has a desirable feature of allowing the sender ciphertext to recover original plaintext from with-out relying on recipient's private decryption (PKE-SR). We propose two efficient methods for converting KEM/DEM (key encapsulation mechanisms/data mechanisms) PKE-SR. The first method, called pre-KEM seeding, can be applied large class constructions including those based discrete logarithm problem. Following idea we an PKE-SR using DHIES, which...
Abstract The lattice-based cryptographic accumulators, which enable short zero-knowledge arguments of membership, have numerous applications in post-quantum privacy-preserving protocols. However, most efficient quantum-safe are PCP-based systems and rely on non-falsifiable assumptions. For non-PCP-based constructions using the state-of-the-art techniques compressing proofs, concrete size resulting proof for accumulators with $2^{32}$ members is at least 500 KB. In this paper, we propose a...
Picnic is a post-quantum digital signature, the security of which relies solely on symmetric-key primitives such as block ciphers and hash functions instead number theoretic assumptions. One main concerns large signature size. Although Katz et al.’s protocol (MPCitH-PP) significantly reduces size Picnic, involvement more parties in MPCitH-PP leads to longer signing/verification times hardware resources. This poses new challenges for implementing high-performance resource-constrained FPGAs....
Symmetric-key primitives designed over the prime field Fp with odd characteristics, rather than traditional Fn2 , are becoming most popular choice for MPC/FHE/ZK-protocols better efficiencies. However, security of is less understood as there highly nontrivial gaps when extending cryptanalysis tools and experiences built on in past few decades to Fp.At CRYPTO 2015, Sun et al. established links among impossible differential, zero-correlation linear, integral from perspective distinguishers. In...