Yongge Wang's Home Page

Yongge Wang
Ph.D. Heidelberg University, Germany
Email:

get email address (decryption key: wang) or scan QR code

Phone: (704) 687-8665
Office Hour: M/W 2:30-3:30pm

Representative Research Areas:
For a complete list of my publications, check my local list with PDFs or Google Scholar or DBLP.

LDPC based erasure codes, LT-codes, digital fountain, efficient perfectly secure secret sharing schemes and applications to cloud storage.
- M. Paterson, Douglas R. Stinson, and Yongge Wang: On Encoding Symbol Degrees of Array BP-XOR Codes. Submitted (pdf)
- Yongge Wang: Array BP-XOR Codes for Reliable Cloud Storage Systems. To appear in: Proc. IEEE ISIT 2013. (pdf)
- Yongge Wang: Efficient LDPC Code Based Secret Sharing Schemes and Private Data Storage in Cloud without Encryption. Submitted (pdf)
- Yongge Wang and Yvo Desmedt. Efficient Secret Sharing Schemes Achieving Optimal Information Rate.
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).
- Y.Wang: Efficient Identity-Based and Authenticated Key Agreement Protocol (pdf). M.L. Gavrilova and C.J.K. Tan (Eds.) Trans. on Comput. Sci. XVII, LNCS 7420, pp. 172--197. Springer, Heidelberg (2013)
- Z.Zhao, Z.Dong, and Y.Wang. Security Analysis of a Password-Based Authentication Protocol Proposed to IEEE 1363 Theoretical Computer Science, 352(1-3):280--287, 7 March 2006. (pdf). Publisher's version.
- Y.Wang. Password Protected Smart Card and Memory Stick Authentication Against Off-line Dictionary Attacks. In: D. Gritzalis, S. Furnell, and M. Theoharidou (Eds.): SEC 2012, IFIP AICT 376, pp. 489-500, 2012.
PSMT (perfectly secure message transmission)
- Y.Wang and Y.Desmedt. Perfectly Secure Message Transmission Revisited. IEEE Transaction on Information Theory 54(6):2582--2595, June 2008. (pdf). Abstract in EuroCrypt'02, pages 502-517, LNCS 2332.
- Y.Wang and Y.Desmedt: Secure communication in multicast channels. Journal of Cryptology 14(2):121--135, 2001. (pdf). Abstract in Eurocrypt 99, pages 443--455. LNCS 1592.
- Y.Wang and Y.Desmedt. Edge-Colored Graphs with Applications To Homogeneous Faults. Information Processing Letters 111(2011) 634-641 (pdf). The publisher version.
- Y.Wang. Insecure ``Provably'' Secure Network Coding and Homomorphic Authentication Sechemes for Network Coding. (pdf).
- Y.Desmedt, Y.Wang and M.Burmester. A complete characterization of tolerable adversary structures for secure point-to-point transmissions. In Proc. 16th ISAAC (ratio: 112/549), LNCS 3827, pages 277-287, 2005. (pdf).
Critical Infrastruction Protection
- Yongge Wang. Smart Grid, Automation, and SCADA Systems Security (pdf). Invited and anonymously refereed Chapter of "Security and Privacy in Smart Grids", 2013, CRC Press (Taylor & Grancis Group). ISBN 978-1-4398-7783-8
- Y.Wang. sSCADA: Securing SCADA Infrastructure Communications (pdf). Int. J. Communication Networks and Distributed Systems, 6(1):59--78, 2011.
- Y.Desmedt and Y.Wang: Analyzing vulnerabilities of critical infrastructures using flows and critical vertices in AND/OR graphs. International Journal of Foundations of Computer Science, 15(1):107--125, 2004 (pdf)
- Y.Wang. Cryptographic Challenges In Smart Grid System Security IEEE Smart Grid Newsletter, December, 2012.
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.
- C.Calude, P.Hertling, B.Khoussainov, and Y.Wang: Recursively enumerable reals and Chaitin's Ω numbers. Theoretical Computer Science 255:125--149, 2001. (pdf)
- Y.Wang: Genericity, randomness, and polynomial time approximations. SIAM Journal on Computing, 28(2):394-408, 1999. (pdf)
- Y.Wang: A separation of two randomness concepts. Information Processing Letters, 69(3):115--118, 1999. (pdf)
- Y.Wang: Resource bounded randomness and computational complexity. Theoretical Computer Science 237(1-2):33--55, 2000. (pdf)
- Y.Wang: Randomness, stochasticity, and approximations. Theory of Computing Systems 32:517--529, 1999. (pdf)
- Y.Wang: NP-hard sets are superterse unless NP is small. Information Processing Letters 61(1):1-6, 1997. (pdf)

Industry Standards:

Secure Remote Password Authentication Protocol SRP5. Included in IEEE 1363.2 standards.
Identity Based Authenticated Key Agreement Protocol WANG-KE. Included in IEEE 1363.3 Standards. (local PDF)
S.Blake-Wilson, G. Karlinger, T. Kobayashi, and Y.Wang: ECDSA with XML-Signature Syntax, IETF RFC 4050, 2005.

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

edu

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

com