dblp.uni-trier.dewww.uni-trier.de

Yongge Wang

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
45EEYongge Wang, Yvo Desmedt: Perfectly Secure Message Transmission Revisited. IEEE Transactions on Information Theory 54(6): 2582-2595 (2008)
2007
44EEXintao Wu, Yongge Wang, Songtao Guo, Yuliang Zheng: Privacy Preserving Database Generation for Database Application Testing. Fundam. Inform. 78(4): 595-612 (2007)
2006
43EEYvo Desmedt, Yongge Wang, Mike Burmester: Revisiting Colored Networks and Privacy Preserving Censorship. CRITIS 2006: 140-150
42EEQiaofang Lian, Yongge Wang, Dunyan Yan: A characterization of Lp(R) by local trigonometric bases with 1<p<infinity. Adv. Comput. Math. 25(1-3): 91-104 (2006)
41EEZhu Zhao, Zhongqi Dong, Yongge Wang: Security analysis of a password-based authentication protocol proposed to IEEE 1363. Theor. Comput. Sci. 352(1-3): 280-287 (2006)
2005
40EEYvo Desmedt, Yongge Wang, Reihaneh Safavi-Naini, Huaxiong Wang: Radio Networks with Reliable Communication. COCOON 2005: 156-166
39EEYongge Wang, Xintao Wu: Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation. ICDM 2005: 482-489
38EEXintao Wu, Chintan Sanghvi, Yongge Wang, Yuliang Zheng: Privacy Aware Data Generation for Testing Database Applications. IDEAS 2005: 317-326
37EEYvo Desmedt, Yongge Wang, Mike Burmester: A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback. ISAAC 2005: 277-287
36EEXintao Wu, Yongge Wang, Yuliang Zheng: Statistical Database Modeling for Privacy Preserving Database Generation. ISMIS 2005: 382-390
35 Xintao Wu, Ying Wu, Yongge Wang, Yingjiu Li: Privacy Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining. SDM 2005
34EEYuliang Zheng, Yongge Wang: Efficient and provably secure ciphers for storage device block level encryption. StorageSS 2005: 103-107
2004
33EEYongge Wang, Xintao Wu, Yuliang Zheng: Privacy Preserving Data Generation for Database Application Performance Testing. TrustBus 2004: 142-151
32EEYvo Desmedt, Yongge Wang: Analyzing Vulnerabilities Of Critical Infrastructures Using Flows And Critical Vertices In And/Or Graphs. Int. J. Found. Comput. Sci. 15(1): 107-125 (2004)
31EEYongge Wang: Robust key establishment in sensor networks. SIGMOD Record 33(1): 14-19 (2004)
2003
30 Zhaoyu Liu, Yongge Wang: A Secure Agent Architecture for Sensor Networks. IC-AI 2003: 10-16
29 Yongge Wang, Yuliang Zheng, Bei-tseng Chu: Efficient and Secure Storage Systems Based on Peer-to-Peer Systems. IC-AI 2003: 17-22
28EEYongge Wang, Yuliang Zheng: Fast and Secure Magnetic WORM Storage Systems. IEEE Security in Storage Workshop 2003: 11-19
27EEXintao Wu, Yongge Wang, Yuliang Zheng: Privacy preserving database application testing. WPES 2003: 118-128
2002
26EEYvo Desmedt, Yongge Wang: Maximum Flows and Critical Vertices in AND/OR Graphs. COCOON 2002: 238-248
25EEYvo Desmedt, Yongge Wang: Perfectly Secure Message Transmission Revisited. EUROCRYPT 2002: 502-517
24EEYvo Desmedt, Yongge Wang: Efficient Zero-Knowledge Proofs for Some Practical Graph Problems. SCN 2002: 290-302
23EEYongge Wang: The algebraic structure of the isomorphic types of tally, polynomial time computable sets. Arch. Math. Log. 41(3): 215-244 (2002)
22EEYvo Desmedt, Yongge Wang: Perfectly Secure Message Transmission Revisited CoRR cs.CR/0208041: (2002)
21EEYongge Wang: A comparison of two approaches to pseudorandomness. Theor. Comput. Sci. 276(1-2): 449-459 (2002)
2001
20EEYongge Wang, Yvo Desmedt: Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question. J. Cryptology 14(2): 121-135 (2001)
19EEWolfgang Merkle, Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Math. Log. Q. 47(2): 249-269 (2001)
18EECristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255(1-2): 125-149 (2001)
2000
17 Yongge Wang: Using Mobile Agent Results to Create Hard-to-Detect Computer Viruses. SEC 2000: 161-170
16 Yongge Wang, Yvo Desmedt, Mike Burmester: Models For Dependable Computation with Multiple Inputs and Some Hardness Results. Fundam. Inform. 42(1): 61-73 (2000)
15EEYongge Wang: Resource bounded randomness and computational complexity. Theor. Comput. Sci. 237(1-2): 33-55 (2000)
1999
14 Yvo Desmedt, Yongge Wang: Approximation Hardness and Secure Communication in Broadcast Channels. ASIACRYPT 1999: 247-257
13 Yongge Wang: Linear Complexity versus Pseudorandomness: On Beth and Dai's Result. ASIACRYPT 1999: 288-298
12EEYongge Wang, Yvo Desmedt: Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question. EUROCRYPT 1999: 446-458
11EEYongge Wang: A Separation of Two Randomness Concepts. Inf. Process. Lett. 69(3): 115-118 (1999)
1998
10EEMike Burmester, Yvo Desmedt, Yongge Wang: Using Approximation Hardness to Achieve Dependable Computation. RANDOM 1998: 172-186
9 Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998: 596-606
8 Yongge Wang: Genericity, Randomness, and Polynomial-Time Approximations. SIAM J. Comput. 28(2): 394-408 (1998)
1997
7 Yongge Wang: Randomness, Stochasticity and Approximations. RANDOM 1997: 213-225
6EEYongge Wang: NP-Hard Sets are Superterse Unless NP is Small. Inf. Process. Lett. 61(1): 1-6 (1997)
5EEPeter Hertling, Yongge Wang: Invariance Properties of Random Sequences. J. UCS 3(11): 1241-1249 (1997)
1996
4EEYongge Wang: The Law of the Iterated Logarithm for p-Random Sequences. IEEE Conference on Computational Complexity 1996: 180-189
3 Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng: Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. STACS 1996: 63-74
2EEYongge Wang: NP-hard Sets Are Superterse unless NP Is Small Electronic Colloquium on Computational Complexity (ECCC) 3(21): (1996)
1995
1 Wolfgang Merkle, Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. MFCS 1995: 179-190

Coauthor Index

1Klaus Ambos-Spies [3]
2Mike Burmester [10] [16] [37] [43]
3Cristian S. Calude (Cristian Calude) [9] [18]
4Bei-tseng Chu [29]
5Yvo Desmedt [10] [12] [14] [16] [20] [22] [24] [25] [26] [32] [37] [40] [43] [45]
6Zhongqi Dong [41]
7Songtao Guo [44]
8Peter Hertling [5] [9] [18]
9Bakhadyr Khoussainov [9] [18]
10Yingjiu Li [35]
11Qiaofang Lian [42]
12Zhaoyu Liu [30]
13Elvira Mayordomo [3]
14Wolfgang Merkle [1] [19]
15Reihaneh Safavi-Naini [40]
16Chintan Sanghvi [38]
17Huaxiong Wang [40]
18Xintao Wu [27] [33] [35] [36] [38] [39] [44]
19Ying Wu [35]
20Dunyan Yan [42]
21Zhu Zhao [41]
22Xizhong Zheng [3]
23Yuliang Zheng [27] [28] [29] [33] [34] [36] [38] [44]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)