Yongge Wang

According to our database1, Yongge Wang authored at least 90 papers between 1995 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Matrix Barcode Based Secure Authentication without Trusting Third Party.
IT Professional, 2019

The limit of blockchains: infeasibility of a smart Obama-Trump contract.
Commun. ACM, 2019

Reusable Garbled Turing Machines Without FHE.
Proceedings of the Codes, Cryptology and Information Security, 2019

The Limit of Blockchains: Infeasibility of a Smart Obama-Trump Contract.
IACR Cryptology ePrint Archive, 2018

Using Sparse Matrices to Prevent Information Leakage in Cloud Computing.
Proceedings of the 6th IEEE International Conference on Future Internet of Things and Cloud, 2018

A Poisoning Attack Against Cryptocurrency Mining Pools.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2018

Remarks on Quaternions/Octonion Based Diffie-Hellman Key Exchange Protocol Submitted to NIST PQC Project.
IACR Cryptology ePrint Archive, 2017

Reducing Garbled Circuit Size While Preserving Circuit Gate Privacy.
IACR Cryptology ePrint Archive, 2017

Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Scheme.
IACR Cryptology ePrint Archive, 2017

Revised Quantum Resistant Public Key Encryption Scheme RLCE and IND-CCA2 Security for McEliece Schemes.
IACR Cryptology ePrint Archive, 2017

Data confidentiality in cloud-based pervasive system.
Proceedings of the Second International Conference on Internet of things and Cloud Computing, 2017

Computational Aspects of Ideal (t, n)-Threshold Scheme of Chen, Laing, and Martin.
Proceedings of the Cryptology and Network Security - 16th International Conference, 2017

Candidate MDS Array Codes for Tolerating Three Disk Failures in RAID-7 Architectures.
Proceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, 2017

Garbled computation in cloud.
Future Generation Comp. Syst., 2016

On encoding symbol degrees of array BP-XOR codes.
Cryptography and Communications, 2016

Quantum resistant random linear code based public key encryption scheme RLCE.
Proceedings of the IEEE International Symposium on Information Theory, 2016

UC-PSkyline: Probabilistic Skyline Queries Over Uncertain Contexts.
Proceedings of the Intelligent Computing Methodologies - 12th International Conference, 2016

Privacy Preserving Computation in Cloud Using Noise-Free Fully Homomorphic Encryption (FHE) Schemes.
Proceedings of the Computer Security - ESORICS 2016, 2016

Secure Communication and Authentication Against Off-line Dictionary Attacks in Smart Grid Systems.
Proceedings of the Security of Industrial Control Systems and Cyber-Physical Systems, 2016

Privacy-Preserving Data Storage in CloudUsing Array BP-XOR Codes.
IEEE Trans. Cloud Computing, 2015

Adaptive Filter Updating for Energy-Efficient Top-k Queries in Wireless Sensor Networks Using Gaussian Process Regression.
IJDSN, 2015

Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping.
IACR Cryptology ePrint Archive, 2015

Secure Random Linear Code Based Public Key Encryption Scheme RLCE.
IACR Cryptology ePrint Archive, 2015

On statistical distance based testing of pseudo random sequences and experiments with PHP and Debian OpenSSL.
Computers & Security, 2015

Asymptotic-Efficient Algorithms for Skyline Query Processing over Uncertain Contexts.
Proceedings of the 19th International Database Engineering & Applications Symposium, 2015

Prediction-Based Filter Updating Policies for Top-k Monitoring Queries in Wireless Sensor Networks.
IJDSN, 2014

Histogram Estimation for Optimal Filter Skyline Query Processing in Wireless Sensor Networks.
IJDSN, 2014

On the Design of LIL Tests for (Pseudo) Random Generators and Some Experimental Results.
IACR Cryptology ePrint Archive, 2014

Efficient secret sharing schemes achieving optimal information rate.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Statistical Properties of Pseudo Random Sequences and Experiments with PHP and Debian OpenSSL.
Proceedings of the Computer Security - ESORICS 2014, 2014

Efficient Identity-Based and Authenticated Key Agreement Protocol.
Trans. Computational Science, 2013

Adaptive Information Coding for Secure and Reliable Wireless Telesurgery Communications.
MONET, 2013

Array BP-XOR codes for reliable cloud storage systems.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Private and Anonymous Data Storage and Distribution in Cloud.
Proceedings of the 2013 IEEE International Conference on Services Computing, Santa Clara, CA, USA, June 28, 2013

Secure Key Distribution for the Smart Grid.
IEEE Trans. Smart Grid, 2012

Password Protected Smart Card and Memory Stick Authentication against Off-Line Dictionary Attacks.
Proceedings of the Information Security and Privacy Research, 2012

Edge-colored graphs with applications to homogeneous faults.
Inf. Process. Lett., 2011

sSCADA: securing SCADA infrastructure communications.
IJCNDS, 2011

Homogeneous Faults, Colored Edge Graphs, and Cover Free Families.
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Insecure "Provably Secure Network Coding" and Homomorphic Authentication Schemes for Network Coding.
IACR Cryptology ePrint Archive, 2010

An image reconstruction algorithm based on compressed sensing using conjugate gradient.
Proceedings of the 4th International Universal Communication Symposium, 2010

Constructivist Approach to Information Security Awareness in the Middle East.
Proceedings of the Fifth International Conference on Broadband and Wireless Computing, 2010

Insecure "Provable Secure Network Coding".
IACR Cryptology ePrint Archive, 2009

Perfectly Secure Message Transmission Revisited.
IEEE Trans. Information Theory, 2008

Privacy Preserving Database Generation for Database Application Testing.
Fundam. Inform., 2007

Security analysis of a password-based authentication protocol proposed to IEEE 1363.
Theor. Comput. Sci., 2006

A characterization of Lp(R) by local trigonometric bases with 1<p (DOI)
Adv. Comput. Math., 2006

Revisiting Colored Networks and Privacy Preserving Censorship.
Proceedings of the Critical Information Infrastructures Security, 2006

Using the Elliptic Curve Signature Algorithm (ECDSA) for XML Digital Signatures.
RFC, April, 2005

Efficient Identity-Based and Authenticated Key Agreement Protocol.
IACR Cryptology ePrint Archive, 2005

Efficient and provably secure ciphers for storage device block level encryption.
Proceedings of the 2005 ACM Workshop On Storage Security And Survivability, 2005

Privacy Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005

Statistical Database Modeling for Privacy Preserving Database Generation.
Proceedings of the Foundations of Intelligent Systems, 15th International Symposium, 2005

A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Privacy Aware Data Generation for Testing Database Applications.
Proceedings of the Ninth International Database Engineering and Applications Symposium (IDEAS 2005), 2005

Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Radio Networks with Reliable Communication.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Robust key establishment in sensor networks.
SIGMOD Record, 2004

Analyzing Vulnerabilities Of Critical Infrastructures Using Flows And Critical Vertices In And/Or Graphs.
Int. J. Found. Comput. Sci., 2004

sSCADA: Securing SCADA Infrastructure Communications.
IACR Cryptology ePrint Archive, 2004

Construction of compactly supported orthonormal wavelets with beautiful structure.
Science in China Series F: Information Sciences, 2004

Privacy Preserving Data Generation for Database Application Performance Testing.
Proceedings of the Trust and Privacy in Digital Business, First International Conference, 2004

Privacy preserving database application testing.
Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, 2003

Fast and Secure Magnetic WORM Storage Systems.
Proceedings of the 2nd International IEEE Security in Storage Workshop (SISW 2003), 2003

Efficient and Secure Storage Systems Based on Peer-to-Peer Systems.
Proceedings of the International Conference on Artificial Intelligence, 2003

A Secure Agent Architecture for Sensor Networks.
Proceedings of the International Conference on Artificial Intelligence, 2003

A comparison of two approaches to pseudorandomness.
Theor. Comput. Sci., 2002

The algebraic structure of the isomorphic types of tally, polynomial time computable sets.
Arch. Math. Log., 2002

Efficient Zero-Knowledge Proofs for Some Practical Graph Problems.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

Perfectly Secure Message Transmission Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Maximum Flows and Critical Vertices in AND/OR Graphs.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question.
J. Cryptology, 2001

Resource bounded randomness and computational complexity.
Theor. Comput. Sci., 2000

Models For Dependable Computation with Multiple Inputs and Some Hardness Results.
Fundam. Inform., 2000

Using Mobile Agent Results to Create Hard-to-Detect Computer Viruses.
Proceedings of the Information Security for Global Information Infrastructures, 2000

Randomness, Stochasticity, and Approximations.
Theory Comput. Syst., 1999

A Separation of Two Randomness Concepts.
Inf. Process. Lett., 1999

Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question.
Proceedings of the Advances in Cryptology, 1999

Linear Complexity versus Pseudorandomness: On Beth and Dai's Result.
Proceedings of the Advances in Cryptology, 1999

Approximation Hardness and Secure Communication in Broadcast Channels.
Proceedings of the Advances in Cryptology, 1999

Genericity, Randomness, and Polynomial-Time Approximations.
SIAM J. Comput., 1998

Recursively Enumerable Reals and Chaitin Omega Numbers.
Proceedings of the STACS 98, 1998

Using Approximation Hardness to Achieve Dependable Computation.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Invariance Properties of Random Sequences.
J. UCS, 1997

NP-Hard Sets are Superterse Unless NP is Small.
Inf. Process. Lett., 1997

Randomness, Stochasticity and Approximations.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

NP-hard Sets Are Superterse unless NP Is Small.
Electronic Colloquium on Computational Complexity (ECCC), 1996

Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness.
Proceedings of the STACS 96, 1996

The Law of the Iterated Logarithm for p-Random Sequences.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995