Yongge Wang's Publications

Survey articles
  1. Yongge Wang. Public Key Cryptography Standards: PKCS (pdf, 150K). Invited and anonymously refereed Chapter of "Handbook of Information Security", John Wiley & Sons, Inc., 2005 Publisher's ToC
  2. Securing eBusiness with cryptographic techniques (pdf 319KB or pdf 945KB). In Bank Fraud and IT Security December 2004 Issue, by Southeast Consulting Inc.
Refereed conference and journal papers
  1. Y.Wang Efficient identity-based and authenticated key agreement protocol (pdf).
  2. Y.Wang and B.Chu. sSCADA: securing SCADA infrastructure communications. (pdf).
  3. Y.Desmedt, Y.Wang and M.Burmester. Revisiting Colored Networks and Privacy Preserving Censorship. Proc. 1st International Workshop on Critical Information Infrastructures Security (CRITIS'06) August 30 - September 2, 2006, Samos Island, Greece. LNCS 4347, pages 140-150, 2006. (pdf), (Yvo Desmedt's slide), ( Springer Verlag version).
  4. 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.
  5. Y.Desmedt and Y. Wang. Survey of Models for Critical Infrastructures and Methods to Measure Robustness. Proc. of the first CRIS International Workshop on Critical Information Infrastructures (CIIW'05).
  6. 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). Publisher's version.
  7. Y.Wang and X.Wu. Approximate inverse frequent itemset mining: privacy, complexity, and approximation. In Proc. 5th IEEE ICDM, (ratio: 69/630), pages 482-289, 2005. (pdf, 79K)
  8. Y.Zheng and Y.Wang. Efficient and provably secure ciphers for storage device block level encryption. In Proc. ACM StorageSS workshop. pages 103-107, 2005. (pdf, 72K)
  9. X.Wu, C.Sanghvi, Y.Wang, and Y.Zheng. Privacy aware data generation for testing database applications. Proc. of Ninth International Database Engineering and Applications Symposium (IDEAS 2005)}, pages 317--326. IEEE Press.
  10. Y.Desmedt, Y.Wang, R.Safavi-Naini, and H.Wang. Radio networks with reliable communications. In Proc. COCOON (ratio: 96/360), pages 156-166, LNCS 3595, 2005. (pdf, 79K)
  11. X.Wu, Y.Wu, Y.Wang, and Y.Li. Privacy aware market basket data set generation: a feasible approach for inverse frequent set mining. In Proc. 5th SIAM International Conference on Data Mining, April 2005.
  12. Y.Wang, X. Wu, and Y. Zheng. Privacy preserving data generation for database application performance testing. In: Proc. 1st International Conference on Trust and Privacy in Digital Business (TrustBus '04) (together with DEXA conference, Zaragoza, Spain), LNCS 3184, pages 142-151. Springer-Verlag. (pdf, 79K)
  13. Y.Wang. Robust key establishment in sensor networks. ACM SIGMOD Record, 33(1):14--19, March 2004. (pdf, 79K, publisher's version)
  14. 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, 61K)
  15. Y.Wang and Y.Zheng. Fast and secure WORM storage systems. In: Proceedings of the IEEE Security in Storage Workshop (SISW), pages 11-19, 2003 (pdf, 73K). Publisher's version
  16. M.Burmester, Y.Desmedt, and Y.Wang. A Critical Analysis of Models for Fault-Tolerant and Secure Computation. In: Proceedings of the IASTED Communication, Network, and Information Security (CNIS) 2003, pages 147-152, 2003 (pdf, 73K).
  17. X.Wu, Y.Wang, and Y.Zheng: Privacy preserving database application testing. Proceedings of the ACM Workshop on Privacy in Electronic Society, (ratio 16/50) pages 118--128, 2003 (pdf, 150K)
  18. Z.Liu and Y.Wang: A secure agent architecture for sensor networks. Proceedings of The 2003 International Conference on Artificial Intelligence--Intelligent Pervasive Computing Workshop (IC-AI'03 June 23-26, 2003, Las Vegas, Nevada, USA), pages 10--16, 2003 (Eds. H.R.Arabnia, R. Joshua, and Y.Mun), CSREA Press (pdf, 61K)
  19. Y.Wang, Y.Zheng, and B.Chu: Efficient and secure storage systems based on peer-to-peer systems. Proceedings of The 2003 International Conference on Artificial IntelligenceIntelligent Pervasive Computing Workshop (IC-AI'03 June 23-26, 2003, Las Vegas, Nevada, USA), pages 17--22, 2003 (Eds. H.R.Arabnia, R. Joshua, and Y.Mun) CSREA Press (pdf, 61K)
  20. Y.Desmedt and Y.Wang: Efficient Zero-knowledge proofs for some practical graph problems. Proceedings of Third Conference on Security in Communication Networks, LNCS 2576, pages 296--308, 2002 (pdf, 150K)
  21. Y.Wang: A comparison of two approaches to pseudorandomness. Theoretical Computer Science 276(1-2):449--459, 2002. (pdf, 170K, publisher's version)
  22. Y.Wang: The algebraic structure of the isomorphic types of tally polynomial time sets. Archive for Mathematical Logic 41(3): 215--244, 2002. (pdf, 301K, publisher's version)
  23. Y.Desmedt and Y.Wang: Maximum Flows and Critical Vertices in AND/OR Graphs COCOON '02 2002, pages 238-248. LNCS 2387, Springer-Verlag. (pdf, 202K). Preliminary results was presented at INFORMS '99 Cincinnati, section SA34.1
  24. Y.Desmedt and Y.Wang: Perfectly Secure Message Transmission Revisited. EuroCrypt'02 2002, pages 502-517. LNCS 2332, Springer-Verlag. (pdf, 259K)
  25. W.Merkle and Y.Wang: Separations by random oracles and almost-classes for generalized reducibilities. Mathematical Logic Quarterly 47(2):249--269, 2001. (pdf, 301K, publisher's version). A preliminary version of this paper appeared in: Proc. of 20th MFCS. LNCS 969, pages 179-190, 1995.
  26. Y.Wang and Y.Desmedt: Secure communication in multicast channels. Journal of Cryptology 14(2):121--135, 2001. (pdf, 264K, publisher's version). A preliminary version of this paper appeared in: Proc. Eurocrypt 99, pages 443--455. LNCS 1592, Springer Verlag. (publisher's version)
  27. C.Calude, P.Hertling, B.Khoussainov, and Y.Wang: Recursively enumerable reals and Chaitin's W numbers. Theoretical Computer Science 255:125--149, 2001. (pdf, 200K, publisher's version). A preliminary version of this paper appeared in: Proc. 15th STACS, pages 596--606. LNCS 1373, Springer Verlag, 1998.
  28. Y.Wang, Y.Desmedt, and M.Burmester: Models for dependable computation with multiple inputs and some hardness results. Fundamenta Informaticae, 42(1):61--73, 2000. (pdf, 251K, publisher's version)
  29. Y.Wang: Resource bounded randomness and computational complexity. Theoretical Computer Science 237(1-2):33--55, 2000. (pdf, 164K, publisher's version)
  30. Y.Wang: Using mobile agent results to create hard-to-detect computer viruses In: Information Security for Global Information Infrastructures, the 16th IFIP SEC (2000), pages 161--170, Kluwer Academic Publishers. (pdf, 159K)
  31. Y.Wang: Category, measure, and polynomial time approximations. SIAM Journal on Computing, 28(2):394-408, 1999. (pdf, 253K, publisher's version)
  32. Y.Wang: A separation of two randomness concepts. Information Processing Letters, 69(3):115--118, 1999. (pdf, 154K, publisher's version)
  33. Y.Wang: Randomness, stochasticity, and approximations. Theory of Computing Systems (formerly: Mathematical Systems Theory) 32:517--529, 1999. (pdf, 77K, publisher's version). A preliminary version of this paper appeared in: Proc. of RANDOM 97 (Italy), pages 213--225. LNCS 1269, Springer Verlag.
  34. Y.Wang: Linear complexity versus pseudorandomness: on Beth and Dai's result. In: Proc. Asiacrypt 99, pages 288--298. LNCS 1716, Springer Verlag. (pdf, 170K)
  35. Y.Desmedt and Y.Wang: Approximation hardness and secure communication in broadcast channels. In: Proc. Asiacrypt 99, pages 247--257. LNCS 1716, Springer Verlag. (pdf, 180K)
  36. Y.Wang: Abuses of probabilistic encryption schemes. IEE Electronics Letters, 34(8):753--754, 1998. (pdf, 92K).
  37. Y.Desmedt, M.Burmester, and Y.Wang: Using approximation hardness to achieve dependable computation. In: Proc. of RANDOM 98, pages 172-186. LNCS 1518, Springer Verlag. (pdf, 201K, publisher's version)
  38. P.Hertling and Y.Wang: Invariance properties of random sequences. Journal of Universal Computer Science, 3(11):1241-1449, 1997. (pdf, 153K, publisher's version)
  39. Y.Wang: NP-hard sets are superterse unless NP is small. Information Processing Letters 61(1):1-6, 1997. (pdf, 153K, publisher's version)
  40. Y.Wang: The law of the iterated logarithm for p-random sequences. In: Proc. 11th IEEE Conference on Computational Complexity (CCC), pages 180-189. IEEE Computer Society Press, 1996. (pdf, 212K)
  41. K.Ambos-Spies, E.Mayordomo, Y.Wang, and X. Zheng: Resource bounded balanced genericity, stochasticity and weak randomness. In: Proc. 13rd STACS, pages 63-74. LNCS 1046, 1996. (pdf, 185K)
  42. Y.Wang: Modified data-flow models and their applications. Chinese Journal of Software, 5(3):43-48, 1994. (pdf, 85K; guobiao, 37K)
  43. G.Hu and Y.Wang: The fundamental theory for object-oriented languages. Chinese Journal of Computer Science, 20(4):1-6, 1993. (pdf, 174K; Word, 86K)
  44. Y.Wang: The computing power of ordered Petri nets. Chinese Journal of Software, 4(3):35-41, 1993. (pdf, 106K; Word, 75K)
  45. S.Xu and Y.Wang: Blum's speedup theorem and the hierarchy of recursive functions. Chinese Journal of Software, 4(4):38-43, 1993. (pdf, 97K; Word, 80K)
  46. G.Hu and Y.Wang: An algorithm and its data structure from sequential US MMCM to parallel machine. In: Computer Mathematics, pages 58-65, World Sci. Publishing, River Edge, NJ, 1993 (MR: 94m:68041). (tex, 18K) The software to implement the algorithm.
  47. Y.Wang: Randomness and Complexity. PhD Thesis, 1996. (pdf, 523K)

Co-authors

Over the past years I have benefited from joint works with following co-authors: