Haibin Kan

Orcid: 0000-0003-3062-5004

According to our database1, Haibin Kan authored at least 150 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Three classes of permutation quadrinomials in odd characteristic.
Cryptogr. Commun., March, 2024

MacWilliams Extension Property With Respect to Weighted Poset Metric.
IEEE Trans. Inf. Theory, February, 2024

A new class of generalized almost perfect nonlinear monomial functions.
Inf. Process. Lett., February, 2024

Two classes of permutation trinomials over Fq3 in characteristic two.
Finite Fields Their Appl., February, 2024

Hitting Times of Random Walks on Edge Corona Product Graphs.
Comput. J., February, 2024

Obtaining simulation extractable NIZKs in the updatable CRS model generically.
Theor. Comput. Sci., January, 2024

On CCZ-equivalence between the Bracken-Tan-Tan function and power functions.
Finite Fields Their Appl., January, 2024

Characterization for a Generic Construction of Bent Functions and Its Consequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

New Classes of Permutation Quadrinomials Over 𝔽<sub><i>q</i><sup>3</sup></sub>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

Four Classes of Bivariate Permutation Polynomials over Finite Fields of Even Characteristic.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

Monomial Boolean functions with large high-order nonlinearities.
Inf. Comput., 2024

Epistle: Elastic Succinct Arguments for Plonk Constraint System.
IACR Cryptol. ePrint Arch., 2024

Linear Proximity Gap for Linear Codes within the 1.5 Johnson Bound.
IACR Cryptol. ePrint Arch., 2024

Improved Soundness Analysis of the FRI Protocol.
IACR Cryptol. ePrint Arch., 2024

r-Minimal Codes with Respect to Rank Metric.
CoRR, 2024

Minimal Ternary Linear Codes from Vectorial Functions.
CoRR, 2024

A Publicly Verifiable Optimistic Fair Exchange Protocol Using Decentralized CP-ABE.
Comput. J., 2024

2023
Learning counterfactual outcomes of MOOC multiple learning behaviors.
Comput. Appl. Eng. Educ., November, 2023

Reflexivity of Partitions Induced by Weighted Poset Metric and Combinatorial Metric.
IEEE Trans. Inf. Theory, October, 2023

Resistance Distances In Simplicial Networks.
Comput. J., August, 2023

Cryptographic functions with interesting properties from CCZ-equivalence.
Cryptogr. Commun., July, 2023

The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20.
IEEE Trans. Inf. Theory, June, 2023

Minimal Binary Linear Codes From Vectorial Boolean Functions.
IEEE Trans. Inf. Theory, May, 2023

On the Number of Affine Equivalence Classes of Vectorial Boolean Functions and <i>q</i>-Ary Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

Privacy-Preserving AGV Collision-Resistance at the Edge Using Location-Based Encryption.
IEEE Trans. Serv. Comput., 2023

Data Collection Maximization in IoT-Sensor Networks via an Energy-Constrained UAV.
IEEE Trans. Mob. Comput., 2023

Trace Monomial Boolean Functions with Large High-Order Nonlinearities.
CoRR, 2023

A note on constructions of bent functions.
CoRR, 2023

Hierarchically Delegatable and Revocable Access Control for Large-Scale IoT Devices with Tradability Based on Blockchain.
Proceedings of the Web and Big Data - 7th International Joint Conference, 2023

2022
Constructing New APN Functions Through Relative Trace Functions.
IEEE Trans. Inf. Theory, 2022

Fourier-Reflexive Partitions Induced by Poset Metric.
IEEE Trans. Inf. Theory, 2022

Generic Constructions of (Boolean and Vectorial) Bent Functions and Their Consequences.
IEEE Trans. Inf. Theory, 2022

Binary Locally Repairable Codes With Large Availability and its Application to Private Information Retrieval.
IEEE Trans. Inf. Theory, 2022

A Galois Connection Approach to Wei-Type Duality Theorems.
IEEE Trans. Inf. Theory, 2022

1-Round Distributed Key Generation With Efficient Reconstruction Using Decentralized CP-ABE.
IEEE Trans. Inf. Forensics Secur., 2022

Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks.
IEEE Trans. Cybern., 2022

Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs.
Theor. Comput. Sci., 2022

A secure dual-color image watermarking scheme based 2D DWT, SVD and Chaotic map.
Multim. Tools Appl., 2022

3D-BCNN-Based Image Encryption With Finite Computing Precision.
IEEE Multim., 2022

More classes of permutation quadrinomials from Niho exponents in characteristic two.
Finite Fields Their Appl., 2022

On the Uniqueness of Balanced Complex Orthogonal Design.
CoRR, 2022

The Covering Radius of the Third-Order Reed-Muller Codes RM(3, 7) is 20.
CoRR, 2022

Some Combinatorial Problems in Power-Law Graphs.
Comput. J., 2022

Poster: Blockchain-Envisioned Secure Generic Communication Framework using Signcryption.
Proceedings of the SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies, New York, NY, USA, June 8, 2022

Fourier-Reflexive Partitions and Group of Linear Isometries with Respect to Weighted Poset Metric.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Minimal Length of Nontrivial Solutions of the Isometry Equation and MacWilliams Extension Property with Respect to Weighted Poset Metric.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Patient-centered cross-enterprise document sharing and dynamic consent framework using consortium blockchain and ciphertext-policy attribute-based encryption.
Proceedings of the CF '22: 19th ACM International Conference on Computing Frontiers, Turin, Italy, May 17, 2022

2021
Minimizing the Maximum Charging Delay of Multiple Mobile Chargers Under the Multi-Node Energy Charging Scheme.
IEEE Trans. Mob. Comput., 2021

New color image cryptosystem via SHA-512 and hybrid domain.
Multim. Tools Appl., 2021

Further constructions of bent functions and their duals.
IET Inf. Secur., 2021

The Explicit Dual of Leander's Monomial Bent Function.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

A New 10-Variable Cubic Bent Function Outside the Completed Maiorana-McFarland Class.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Two classes of permutation trinomials with Niho exponents.
Finite Fields Their Appl., 2021

Constructing vectorial bent functions via second-order derivatives.
Discret. Math., 2021

Revocable Data Sharing Methodology Based on SGX and Blockchain.
Proceedings of the Network and System Security - 15th International Conference, 2021

2020
Reliability-Aware Virtualized Network Function Services Provisioning in Mobile Edge Computing.
IEEE Trans. Mob. Comput., 2020

Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields.
IEEE Trans. Inf. Theory, 2020

Edge Computing to Secure IoT Data Ownership and Trade with the Ethereum Blockchain.
Sensors, 2020

Two classes of permutation trinomials with Niho exponents over finite fields with even characteristic.
Finite Fields Their Appl., 2020

On constructions and properties of (n, m)-functions with maximal number of bent components.
Des. Codes Cryptogr., 2020

Locally repairable codes from combinatorial designs.
Sci. China Inf. Sci., 2020

Permutation polynomials $${x^{{2^{k + 1}} + 3}} + a{x^{{2^k} + 2}} + bx$$x2k+1+3+ax2k+2+bx over $${F_{{2^{2k}}}}$$F22k and their differential uniformity.
Sci. China Inf. Sci., 2020

Characterizing differential support of vectorial Boolean functions using the Walsh transform.
Sci. China Inf. Sci., 2020

Several new infinite families of bent functions via second order derivatives.
Cryptogr. Commun., 2020

SAO 1-Resilient Functions With Lower Absolute Indicator in Even Variables.
IEEE Access, 2020

Power-Law Graphs Have Minimal Scaling of Kemeny Constant for Random Walks.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

2019
Self-Dual Near MDS Codes from Elliptic Curves.
IEEE Trans. Inf. Theory, 2019

Constructing vectorial bent functions via second-order derivatives.
CoRR, 2019

Minimizing the Longest Charge Delay of Multiple Mobile Chargers for Wireless Rechargeable Sensor Networks by Charging Multiple Sensors Simultaneously.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

2018
Color image DNA encryption using NCA map-based CML and one-time keys.
Signal Process., 2018

A robust and lossless DNA encryption scheme for color images.
Multim. Tools Appl., 2018

More New Classes of Differentially 4-Uniform Permutations with Good Cryptographic Properties.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Locally repairable codes with strict availability from linear functions.
Sci. China Inf. Sci., 2018

Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids - [Extended Abstract].
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017
A New Construction of Exact-Repair MSR Codes Using Linearly Dependent Vectors.
IEEE Commun. Lett., 2017

Quantum MDS codes with relatively large minimum distance from Hermitian self-orthogonal codes.
Des. Codes Cryptogr., 2017

Construction of binary linear codes via rational function fields.
Des. Codes Cryptogr., 2017

A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems.
CoRR, 2017

A construction of (5, 3) MDS codes with optimal repair capability for distributed storage systems.
Proceedings of the 9th International Conference on Wireless Communications and Signal Processing, 2017

2016
A novel lossless color image encryption scheme using 2D DWT and 6D hyperchaotic system.
Inf. Sci., 2016

On the criteria for designing complex orthogonal space-time block codes.
Sci. China Inf. Sci., 2016

Probabilistic Autoreductions.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
On the Minimum Decoding Delay of Balanced Complex Orthogonal Designs.
IEEE Trans. Inf. Theory, 2015

Decoding of Dual-Containing Codes From Hermitian Tower and Applications.
IEEE Trans. Inf. Theory, 2015

Revisiting a randomized algorithm for the minimum rainbow subgraph problem.
Theor. Comput. Sci., 2015

A refined analysis on the jump number problem of interval orders.
Inf. Process. Lett., 2015

Improved MILP Modeling for Automatic Security Evaluation and Application to FOX.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Construction of one special minimum storage regenerating code when α=2.
Sci. China Inf. Sci., 2015

A new color image encryption scheme based on DNA sequences and multiple improved 1D chaotic maps.
Appl. Soft Comput., 2015

An improved secure communication scheme based passive synchronization of hyperchaotic complex nonlinear system.
Appl. Math. Comput., 2015

Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

Hermitian codes in distributed storage systems with optimal error-correcting capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A Blind Dual Color Images Watermarking Method via SVD and DNA Sequences.
Proceedings of the Information Security and Cryptology - 11th International Conference, 2015

2014
A note on sparse solutions of sparse linear systems.
Theor. Comput. Sci., 2014

Capacity factors in a point-to-point network.
Inf. Sci., 2014

The Degree of Two Classes of 3rd Order Correlation Immune Symmetric Boolean Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

An Average-Case Efficient Algorithm on Testing the Identity of Boolean Functions in Trace Representation.
IEICE Trans. Inf. Syst., 2014

Linear Exact-Repair Construction of Hybrid MSR Codes in Distributed Storage Systems.
IEEE Commun. Lett., 2014

A new color image cryptosystem via hyperchaos synchronization.
Commun. Nonlinear Sci. Numer. Simul., 2014

2013
Practically Feasible Design for Convolutional Network Code.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

An Efficient Hybrid Cryptographic Scheme for Wireless Sensor Network with Network Coding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

On the Minimum Decoding Delay of Balanced Complex Orthogonal Design.
CoRR, 2013

Explicit-form complex orthogonal design for space-time block codes.
Sci. China Inf. Sci., 2013

An efficient interpolation-based systematic encoder for low-rate Blaum-Roth codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Standard form for balanced complex orthogonal design.
Proceedings of the International Workshop on High Mobility Wireless Communications, 2013

2012
On 2k -Variable Symmetric Boolean Functions With Maximum Algebraic Immunity k.
IEEE Trans. Inf. Theory, 2012

Complex Orthogonal Designs With Forbidden 2,×,2 Submatrices.
IEEE Trans. Inf. Theory, 2012

A novel elementary construction of matching vectors.
Inf. Process. Lett., 2012

Some results on fast algebraic attacks and higher-order non-linearities.
IET Inf. Secur., 2012

Smaller Bound of Superconcentrator.
IEICE Trans. Inf. Syst., 2012

A Note on the Construction of Differentially Uniform Permutations Using Extension Fields.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Constructing Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on an Odd Number of Variables.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

An Efficient Interpolation Based Erasure-Only Decoder for High-Rate Reed-Solomon Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

A construction method of matroidal networks.
Sci. China Inf. Sci., 2012

A characterization of solvability for a class of networks.
Sci. China Inf. Sci., 2012

A new scheme of digital communication using chaotic signals in MIMO channels.
Sci. China Inf. Sci., 2012

Novel constructions of complex orthogonal designs for space-time block codes.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
On Symmetric Boolean Functions With High Algebraic Immunity on Even Number of Variables.
IEEE Trans. Inf. Theory, 2011

Holographic reduction for some counting problems.
Inf. Process. Lett., 2011

A Constructive Method of Algebraic Attack with Less Keystream Bits.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Constructing Correlation Immune Symmetric Boolean Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Annihilators and Algebraic Immunity of Symmetric Boolean Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Constructing Even-Variable Symmetric Boolean Functions with High Algebraic Immunity.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity".
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$
CoRR, 2011

On the nonexistence of $[\binom{2m}{m-1}, 2m, \binom{2m-1}{m-1}]$, $m$ odd, complex orthogonal design
CoRR, 2011

On systematic encoding for Blaum-Roth codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Constructions of cryptographically significant boolean functions using primitive polynomials.
IEEE Trans. Inf. Theory, 2010

Space-Time Block Codes from Quasi-Orthogonal Designs with Maximal Rate or Minimal Decoding Complexity.
IEICE Trans. Commun., 2010

Constructing and Counting Boolean Functions on Even Variables with Maximum Algebraic Immunity.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

The maximal rates and minimal decoding delay of more general complex orthogonal designs.
Sci. China Inf. Sci., 2010

2009
New Balanced Boolean Functions with Good Cryptographic Properties.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

A New Quaternion Design for Space-Time-Polarization Block Code with Full Diversity.
IEICE Trans. Commun., 2009

The generalization of some trellis properties of linear codes to group codes.
Sci. China Ser. F Inf. Sci., 2009

Space-Time Coding and Processing with Differential Chaos Shift Keying Scheme.
Proceedings of IEEE International Conference on Communications, 2009

2008
A Novel Quaternion Design Construction For STBC.
Proceedings of IEEE International Conference on Communications, 2008

Searching for Capacity Factors is NP-Complete.
Proceedings of IEEE International Conference on Communications, 2008

2007
The capacity factors of a network.
Proceedings of the 2007 International Conference on Parallel Processing Workshops (ICPP Workshops 2007), 2007

Network Coding With Interleaving.
Proceedings of the 2007 International Conference on Parallel Processing Workshops (ICPP Workshops 2007), 2007

2006
Lower bounds on the minimal delay of complex orthogonal designs with maximal rates.
IEEE Trans. Commun., 2006

The Characteristic Generators for a Group Code.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

2005
A relation between the Characteristic Generators of a linear code and its dual.
IEEE Trans. Inf. Theory, 2005

A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates.
IEEE Trans. Inf. Theory, 2005

The Bases Associated with Trellises of a Lattice.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Some Trellis Properties on Lattices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Trellis Properties of Product Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

The maximal rates of more general complex orthogonal designs.
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

Reliability-Latency Tradeoffs for Data Gathering in Random-Access Wireless Sensor Networks.
Proceedings of the Grid and Cooperative Computing - GCC 2005, 4th International Conference, Beijing, China, November 30, 2005

2003
Nearest lattice point algorithms on semi<i>k</i>-reduced basis.
Sci. China Ser. F Inf. Sci., 2003

The Closest Vector Problem on Some Lattices.
Proceedings of the Grid and Cooperative Computing, Second International Workshop, 2003


  Loading...