Yongge Wang
Ph.D. Heidelberg University, Germany
Email:
Phone: (704) 687-8665
Office Hour: M/W 2:30-3:30pm

Representative Research Areas:
Yongge Wang has published in the following academic conferences and journals: ACM SIGMOD Record, Asia Crypt, Archive for Mathematical Logic, CIIW, CCC(IEEE), COCOON, CPNS (INFOCOM workshop), ESORICS, EuroCrypt, Fundamenta Informaticae, ICITS, IDEAS, IEEE ICDM, IEEE ISIT, IEEE Tran. Information Theory, IEEE Tran. Cloud Computing, IEEE SCC, IFIP SEC, INFORMS, Int. J. Foundations of Computer Science, IPL (Information Processing Letters), ISAAC, J. Cryptology , J. Universal Computer Science, J. Software (Chinese), Mathematical Logic Quarterly, MFCS, Mobile Networks and Applications, Privacy in Electronic Society (ACM Workshop), RANDOM, SCN, Security in Storage Workshop (IEEE), SIAM ICDM, SIAM J. Computing, StorageSS workshop (ACM Workshop). Theoretical Computer Science, Theory of Computing Systems, Trans. on Comput. Sci., TrustBus For a complete list of my publications, check my own collection with PDFs to download or Google Scholar or DBLP.

if you are trying to download some paper and the link is broken, please rename the link and you will get it. For example, if the link ...sss.pdf for a paper is broken, try to rename it to: ...sssPROTECTED.pdf. This is to avoid some automatic indexing

  1. Pseudorandomness and statistical testing (more details here)
  2. LDPC based erasure codes, LT-codes, digital fountain, efficient perfectly secure secret sharing schemes and applications to cloud storage.
  3. Secure authenticated communications: identity based or password based (avoiding off line dictionary attacks). Two of my protocols have been included in the IEEE 1363 Standards. They are: secure remote authentication protocol with passwords SRP5 in IEEE 1363.2 and identity based key agreement WANG-KE in IEEE 1363.3. IEEE 1363 is one of the most important standards for industry cryptographic techniques. Recently, I am also interested in secure password protocols for smart cards and memory sticks (or multi factor authentication).
  4. PSMT (perfectly secure message transmission)
  5. Critical Infrastruction Protection
  6. Algorithmic Information Theory and Complexity. Several of my papers have laid the foundation for effective randomness. In particular, we have showed that a computably enumerable infinite string is Martin-Lof random if and only if it is the halting probability of the universal Turing machine. Furthermore, I have showed the separation of several randomness concepts such as recursive randomness and recursively constructive randomness (Schnorr randomness). I have a separate Omega Randomness page.
Industry Standards:
Effective Randomness and Ω numbers Page
Teaching | Research | Erdos | CV
Industry contributions
Selected course projects

Address
Woodward Hall 330E
Dept. of Software and Information Systems
College of Computing and Informatics
University of North Carolina at Charlotte
9201 University City Blvd, Charlotte, NC 28223
phone: 704-687-8665
fax: 704-687-4893
email: yonwang-at-uncc-dot-edu
my bitcoin address:

In case you send me email to my UNCC email account and do not get reply, the email could get lost there and you may send the email to: yongge.wang-at-gmail-dot-com