San Ling

According to our database1, San Ling authored at least 199 papers between 1996 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Patch-Based Holographic Image Sensing.
SIAM J. Imaging Sci., 2021

New bounds on the minimum distance of cyclic codes.
Adv. Math. Commun., 2021

2020
On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications.
IEEE Trans. Inf. Theory, 2020

Provably Secure Group Signature Schemes From Code-Based Assumptions.
IEEE Trans. Inf. Theory, 2020

Burst-Deletion-Correcting Codes for Permutations and Multipermutations.
IEEE Trans. Inf. Theory, 2020

Compact Code-Based Signature for Reconfigurable Devices With Side Channel Resilience.
IEEE Trans. Circuits Syst. I Regul. Pap., 2020

Lightweight Key Encapsulation Using LDPC Codes on FPGAs.
IEEE Trans. Computers, 2020

Robust Positioning Patterns with Low Redundancy.
SIAM J. Comput., 2020

Public key encryption with equality test in the standard model.
Inf. Sci., 2020

Insecurity of the Public Key Encryption with Filtered Equality Test Proposed by Huang et al.
IACR Cryptol. ePrint Arch., 2020

A Comparison of Distance Bounds for Quasi-Twisted Codes.
CoRR, 2020

Quasi-Cyclic Codes.
CoRR, 2020

An explicit expression for Euclidean self-dual cyclic codes of length 2<sup>k</sup> over Galois ring GR(4, m).
CoRR, 2020

Holographic Image Sensing.
CoRR, 2020

Perfect State Transfer on Cayley Graphs over Dihedral Groups: The Non-Normal Case.
Electron. J. Comb., 2020

2019
PEIGEN - a Platform for Evaluation, Implementation, and Generation of S-boxes.
IACR Trans. Symmetric Cryptol., 2019

Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories.
IEEE Trans. Inf. Theory, 2019

Private Compound Wildcard Queries Using Fully Homomorphic Encryption.
IEEE Trans. Dependable Secur. Comput., 2019

Lattice-based group signatures: Achieving full dynamicity (and deniability) with ease.
Theor. Comput. Sci., 2019

Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption.
Theor. Comput. Sci., 2019

Public key encryption with equality test from generic assumptions in the random oracle model.
Inf. Sci., 2019

SoK: Peigen - a Platform for Evaluation, Implementation, and Generation of S-boxes.
IACR Cryptol. ePrint Arch., 2019

Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes.
Des. Codes Cryptogr., 2019

On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials.
Des. Codes Cryptogr., 2019

Construction and enumeration for self-dual cyclic codes over Z<sub>4</sub> of oddly even length.
Des. Codes Cryptogr., 2019

Good Stabilizer Codes from Quasi-Cyclic Codes over F<sub>4</sub> and F<sub>9</sub>.
CoRR, 2019

Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation.
Comput. J., 2019

Search Condition-Hiding Query Evaluation on Encrypted Databases.
IEEE Access, 2019

Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Forward-Secure Group Signatures from Lattices.
Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

Non-malleable Coding for Arbitrary Varying Channels.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Spectral Bounds for Quasi-Twisted Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Threshold Changeable Ramp Secret Sharing.
Proceedings of the Cryptology and Network Security - 18th International Conference, 2019

2018
Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes.
IEEE Trans. Inf. Theory, 2018

A lattice-based group signature scheme with verifier-local revocation.
Theor. Comput. Sci., 2018

Accountable Tracing Signatures from Lattices.
IACR Cryptol. ePrint Arch., 2018

Constant-size Group Signatures from Lattices.
IACR Cryptol. ePrint Arch., 2018

Lattice-Based Zero-Knowledge Arguments for Integer Relations.
IACR Cryptol. ePrint Arch., 2018

Holographic Sensing.
CoRR, 2018

The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields.
Cryptogr. Commun., 2018

Construction of de Bruijn sequences from product of two irreducible polynomials.
Cryptogr. Commun., 2018

New MILP Modeling: Improved Conditional Cube Attacks on Keccak-Based Constructions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease.
IACR Cryptol. ePrint Arch., 2017

Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash.
IACR Cryptol. ePrint Arch., 2017

On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications.
IACR Cryptol. ePrint Arch., 2017

Three new classes of optimal frequency-hopping sequence sets.
Des. Codes Cryptogr., 2017

Large Order Binary de Bruijn Sequences via Zech's Logarithms.
CoRR, 2017

Hardness of k-LWE and Applications in Traitor Tracing.
Algorithmica, 2017

Revocable Predicate Encryption from Lattices.
Proceedings of the Provable Security, 2017

Permutation codes correcting a single burst deletion II: Stable deletions.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Geometric orthogonal codes better than optical orthogonal codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Adaptive Oblivious Transfer with Access Control from Lattice Assumptions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Spectral Analysis of Quasi-Cyclic Product Codes.
IEEE Trans. Inf. Theory, 2016

Analysis of Gong et al.'s CCA2-secure homomorphic encryption.
Theor. Comput. Sci., 2016

Semi-generic construction of public key encryption and identity-based encryption with equality test.
Inf. Sci., 2016

Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions.
IACR Cryptol. ePrint Arch., 2016

Better Security for Queries on Encrypted Databases.
IACR Cryptol. ePrint Arch., 2016

Enumeration formulas for self-dual cyclic codes.
Finite Fields Their Appl., 2016

CCA2 Attack and Modification of Huang <i>et al</i>.'s Public Key Encryption with Authorized Equality Test.
Comput. J., 2016

On self-dual cyclic codes of length p<sup>a</sup> over GR(p<sup>2</sup>, s).
Adv. Math. Commun., 2016

On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

String concatenation construction for Chebyshev permutation channel codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Rates of constant-composition codes that mitigate intercell interference.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015
Application of Constacyclic Codes to Quantum MDS Codes.
IEEE Trans. Inf. Theory, 2015

Polyadic Constacyclic Codes.
IEEE Trans. Inf. Theory, 2015

Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-based.
IACR Cryptol. ePrint Arch., 2015

On the Efficiency of FHE-based Private Queries.
IACR Cryptol. ePrint Arch., 2015

A Provably Secure Group Signature Scheme from Code-Based Assumptions.
IACR Cryptol. ePrint Arch., 2015

Hulls of cyclic and negacyclic codes over finite fields.
Finite Fields Their Appl., 2015

Quasi-abelian codes.
Des. Codes Cryptogr., 2015

Construction of Quasi-Cyclic Product Codes.
CoRR, 2015

2014
Hermitian Self-Dual Abelian Codes.
IEEE Trans. Inf. Theory, 2014

On the Multidimensional Distribution of the Naor-Reingold Pseudo-Random Function.
Math. Comput., 2014

A relation between embedding degrees and class numbers of binary quadratic forms.
Math. Comput., 2014

Low Probability Differentials and the Cryptanalysis of Full-Round CLEFIA-128.
IACR Cryptol. ePrint Arch., 2014

Homogeneous weights of matrix product codes over finite principal ideal rings.
Finite Fields Their Appl., 2014

Matrix product codes over finite commutative Frobenius rings.
Des. Codes Cryptogr., 2014

Shorter identity-based encryption via asymmetric pairings.
Des. Codes Cryptogr., 2014

The relation and transformation between hierarchical inner product encryption and spatial encryption.
Des. Codes Cryptogr., 2014

Spatial encryption supporting non-monotone access structure.
Des. Codes Cryptogr., 2014

Hermitian Self-Dual Cyclic Codes of Length $p^a$ over $GR(p^2, s)$.
CoRR, 2014

Self-dual cyclic codes over finite chain rings.
CoRR, 2014

The resistance of PRESENT-80 against related-key differential attacks.
Cryptogr. Commun., 2014

Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Efficient Two-Server Password-Only Authenticated Key Exchange.
IEEE Trans. Parallel Distributed Syst., 2013

Abelian Codes in Principal Ideal Group Algebras.
IEEE Trans. Inf. Theory, 2013

CSS-Like Constructions of Asymmetric Quantum Codes.
IEEE Trans. Inf. Theory, 2013

Upper Bounds on Matching Families in BBZ<sub>pq</sub><sup>n</sup>.
IEEE Trans. Inf. Theory, 2013

On the Fourier Spectra of New APN Functions.
SIAM J. Discret. Math., 2013

Revocable IBE Systems with Almost Constant-size Key Update.
IACR Cryptol. ePrint Arch., 2013

A q-polynomial approach to cyclic codes.
Finite Fields Their Appl., 2013

New results on two hypercube coloring problems.
Discret. Appl. Math., 2013

Upper Bounds on Matching Families in $\mathbb{Z}_{pq}^n$
CoRR, 2013

Query-Efficient Locally Decodable Codes of Subexponential Length.
Comput. Complex., 2013

Fully Secure Attribute-Based Systems with Short Ciphertexts/Signatures and Threshold Access Structures.
Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

2012
Threshold changeable secret sharing schemes revisited.
Theor. Comput. Sci., 2012

Constructing irreducible polynomials over finite fields.
Math. Comput., 2012

Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences.
Math. Comput., 2012

On the modular inversion hidden number problem.
J. Symb. Comput., 2012

On the (In)Security of IDEA in Various Hashing Modes.
IACR Cryptol. ePrint Arch., 2012

Improved Zero-knowledge Proofs of Knowledge for the ISIS Problem, and Applications.
IACR Cryptol. ePrint Arch., 2012

On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2012

Shorter IBE and Signatures via Asymmetric Pairings.
IACR Cryptol. ePrint Arch., 2012

A note on linearized polynomials and the dimension of their kernels.
Finite Fields Their Appl., 2012

A note on cyclic codes over GR(p 2, m) of length p k.
Des. Codes Cryptogr., 2012

Cumulative Distance Enumerators of Random Codes and their Thresholds
CoRR, 2012

Anonymous and Adaptively Secure Revocable IBE with Constant Size Public Parameters
CoRR, 2012

Skew constacyclic codes over finite chain rings.
Adv. Math. Commun., 2012

Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllers.
Proceedings of the Selected Areas in Cryptography, 19th International Conference, 2012

NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Standardized Signature Algorithms on Ultra-constrained 4-Bit MCU.
Proceedings of the Advances in Information and Computer Security, 2012

Differential Attacks against Stream Cipher ZUC.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Authentication of Digital Streams.
IEEE Trans. Inf. Theory, 2011

On Self-Dual Cyclic Codes Over Finite Fields.
IEEE Trans. Inf. Theory, 2011

Additive Asymmetric Quantum Codes.
IEEE Trans. Inf. Theory, 2011

Side-Channel Resistant Crypto for Less than 2, 300 GE.
J. Cryptol., 2011

Structure of functional codes defined on non-degenerate Hermitian varieties.
J. Comb. Theory, Ser. A, 2011

Improved Meet-in-the-Middle Cryptanalysis of KTANTAN.
IACR Cryptol. ePrint Arch., 2011

Revocable Identity-Based Encryption from Lattices.
IACR Cryptol. ePrint Arch., 2011

Fully Secure Spatial Encryption under Simple Assumptions with Constant-Size Ciphertexts.
IACR Cryptol. ePrint Arch., 2011

Association schemes arising from bent functions.
Des. Codes Cryptogr., 2011

List decodability at small radii.
Des. Codes Cryptogr., 2011

From skew-cyclic codes to asymmetric quantum codes.
Adv. Math. Commun., 2011

Pushing the Limits: A Very Compact and a Threshold Implementation of AES.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Improved Meet-in-the-Middle Cryptanalysis of KTANTAN (Poster).
Proceedings of the Information Security and Privacy - 16th Australasian Conference, 2011

2010
Asymmetric quantum codes: characterization and constructions.
IEEE Trans. Inf. Theory, 2010

Generalization of Steane's enlargement construction of quantum codes and applications.
IEEE Trans. Inf. Theory, 2010

Application of classical hermitian self-orthogonal MDS codes to quantum MDS codes.
IEEE Trans. Inf. Theory, 2010

Linear size optimal q-ary constant-weight codes and constant-composition codes.
IEEE Trans. Inf. Theory, 2010

Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2.
IACR Cryptol. ePrint Arch., 2010

Query-Efficient Locally Decodable Codes.
Electron. Colloquium Comput. Complex., 2010

Checkable Codes from Group Rings
CoRR, 2010

On Asymmetric Quantum MDS Codes
CoRR, 2010

256 Bit Standardized Crypto for 650 GE - GOST Revisited.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2010

On Multidimensional Linear Cryptanalysis.
Proceedings of the Information Security and Privacy - 15th Australasian Conference, 2010

2009
On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions.
IEEE Trans. Inf. Theory, 2009

Properties and Applications of Preimage Distributions of Perfect Nonlinear Functions.
IEEE Trans. Inf. Theory, 2009

Practical pseudo-collisions for hash functions ARIRANG-224/384.
IACR Cryptol. ePrint Arch., 2009

Cyclic Codes and Sequences from Kasami-Welch Functions
CoRR, 2009

Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions
CoRR, 2009

On the constructions of constant-composition codes from perfect nonlinear functions.
Sci. China Ser. F Inf. Sci., 2009

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes.
Proceedings of the Cryptography and Coding, 2009

Cryptanalysis of the LAKE Hash Family.
Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

2008
Access Structures of Elliptic Secret Sharing Schemes.
IEEE Trans. Inf. Theory, 2008

Improved Lower Bounds for Constant GC-Content DNA Codes.
IEEE Trans. Inf. Theory, 2008

The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution.
IEEE Trans. Inf. Theory, 2008

Cycle Systems in the Complete Bipartite Graph Plus a One-Factor.
SIAM J. Discret. Math., 2008

Some constructions of (t, m, s)-nets with improved parameters.
Finite Fields Their Appl., 2008

Cyclic codes over GR(p<sup>2</sup>, m) of length p<sup>k</sup>.
Finite Fields Their Appl., 2008

Cryptanalysis of Rabbit.
Proceedings of the Information Security, 11th International Conference, 2008

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 2008

2007
The PBD-Closure of Constant-Composition Codes.
IEEE Trans. Inf. Theory, 2007

Constructions for q-Ary Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2007

Cryptanalysis of LASH.
IACR Cryptol. ePrint Arch., 2007

Constructions and bounds on linear error-block codes.
Des. Codes Cryptogr., 2007

2006
A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes.
IEEE Trans. Inf. Theory, 2006

On the reliability-order-based decoding algorithms for binary linear block codes.
IEEE Trans. Inf. Theory, 2006

Asymptotic bounds on quantum codes from algebraic geometry codes.
IEEE Trans. Inf. Theory, 2006

Aperiodic and Odd Correlations of Some p-Ary Sequences from Galois Rings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots.
Des. Codes Cryptogr., 2006

Cyclic Codes Over Z<sub>4</sub> of Even Length.
Des. Codes Cryptogr., 2006

An explicit class of codes with good parameters and their duals.
Discret. Appl. Math., 2006

2005
The Probability of Undetected Error for Binary Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2005

On the algebraic structure of quasi-cyclic codes III: generator theory.
IEEE Trans. Inf. Theory, 2005

Quantum codes from concatenated algebraic-geometric codes.
IEEE Trans. Inf. Theory, 2005

Improved <i>p</i>-ary Codes and Sequence Families from Galois Rings of Characteristic <i>p</i><sup>2</sup>.
SIAM J. Discret. Math., 2005

On the variance of average distance of subsets in the Hamming space.
Discret. Appl. Math., 2005

Improved Bounds on Weil Sums over Galois Rings and Homogeneous Weights.
Proceedings of the Coding and Cryptography, International Workshop, 2005

2004
Polyadic codes revisited.
IEEE Trans. Inf. Theory, 2004

An improvement on the bounds of Weil exponential sums over Galois rings with some applications.
IEEE Trans. Inf. Theory, 2004

On Viterbi-like algorithms and their application to Reed-Muller codes.
J. Complex., 2004

Z<sub>8</sub>-Kerdock codes and pseudorandom binary sequences.
J. Complex., 2004

A family of group character codes.
Eur. J. Comb., 2004

Type II codes over F<sub>2<sup>m</sup></sub>+uF<sub>2<sup>m</sup></sub>.
Discret. Math., 2004

Improved p-ary Codes and Sequence Families from Galois Rings.
Proceedings of the Sequences and Their Applications, 2004

2003
Good self-dual quasi-cyclic codes exist.
IEEE Trans. Inf. Theory, 2003

New lower bounds and constructions for binary codes correcting asymmetric errors.
IEEE Trans. Inf. Theory, 2003

On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings.
Des. Codes Cryptogr., 2003

Nonlinear p-ary Sequences.
Appl. Algebra Eng. Commun. Comput., 2003

2002
Z<sub>pk+1</sub>-Linear codes.
IEEE Trans. Inf. Theory, 2002

New binary linear codes from algebraic curves.
IEEE Trans. Inf. Theory, 2002

2001
On the algebraic structure of quasi-cyclic codes I: Finite fields.
IEEE Trans. Inf. Theory, 2001

Duadic codes over Z<sub>2k</sub>.
IEEE Trans. Inf. Theory, 2001

Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound.
IEEE Trans. Inf. Theory, 2001

Decomposing Quasi-Cyclic Codes.
Electron. Notes Discret. Math., 2001

Type II Codes Over<i>F</i><sub>4</sub> + <i>uF</i><sub>4</sub>.
Eur. J. Comb., 2001

Duadic Codes over F<sub>2</sub> + uF<sub>2</sub>.
Appl. Algebra Eng. Commun. Comput., 2001

2000
A class of linear codes with good parameters.
IEEE Trans. Inf. Theory, 2000

A class of linear codes with good parameters from algebraic curves.
IEEE Trans. Inf. Theory, 2000

Split group codes.
IEEE Trans. Inf. Theory, 2000

Elementary 2-group character codes.
IEEE Trans. Inf. Theory, 2000

Secret-sharing with a class of ternary codes.
Theor. Comput. Sci., 2000

1999
Attack on RSA-Type Cryptosystems Based on Singular Cubic Curves over Z/nZ.
Theor. Comput. Sci., 1999

1998
Explicit Sequence Expansions.
Proceedings of the Sequences and their Applications, 1998

1997
A Rabin-Type Scheme Based on y<sup>2</sup> equiv x<sup>3</sup> + bx<sup>2</sup> mod n.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Efficient Generation of Elliptic Curve Cryptosystems.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996


  Loading...