| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Yongge Wang Xintao Wu , Yongge Wang, Yuliang Zheng : Statistical Database Modeling for Privacy Preserving Database Generation. ISMIS 2005 : 382-390 Yongge Wang, Xintao Wu , Yuliang Zheng : Privacy Preserving Data Generation for Database Application Performance Testing. TrustBus 2004 : 142-151 Yvo 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) Yongge Wang: Robust key establishment in sensor networks. SIGMOD Record 33 (1): 14-19 (2004) Zhaoyu Liu , Yongge Wang: A Secure Agent Architecture for Sensor Networks. IC-AI 2003 : 10-16 Yongge Wang, Yuliang Zheng , Bei-tseng Chu : Efficient and Secure Storage Systems Based on Peer-to-Peer Systems. IC-AI 2003 : 17-22 Yongge Wang, Yuliang Zheng : Fast and Secure Magnetic WORM Storage Systems. IEEE Security in Storage Workshop 2003 : 11-19 Xintao Wu , Yongge Wang, Yuliang Zheng : Privacy preserving database application testing. WPES 2003 : 118-128 Yvo Desmedt , Yongge Wang: Maximum Flows and Critical Vertices in AND/OR Graphs. COCOON 2002 : 238-248 Yvo Desmedt , Yongge Wang: Perfectly Secure Message Transmission Revisited. EUROCRYPT 2002 : 502-517 Yvo Desmedt , Yongge Wang: Efficient Zero-Knowledge Proofs for Some Practical Graph Problems. SCN 2002 : 290-302 Yvo Desmedt , Yongge Wang: Perfectly Secure Message Transmission Revisited CoRR cs.CR/0208041 : (2002) Yongge Wang: A comparison of two approaches to pseudorandomness. Theor. Comput. Sci. 276 (1-2): 449-459 (2002) Yongge Wang, Yvo Desmedt : Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question. J. Cryptology 14 (2): 121-135 (2001) Wolfgang Merkle , Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Math. Log. Q. 47 (2): 249-269 (2001) Cristian Calude , Peter Hertling , Bakhadyr Khoussainov , Yongge Wang: Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255 (1-2): 125-149 (2001) Yongge Wang: Using Mobile Agent Results to Create Hard-to-Detect Computer Viruses. SEC 2000 : 161-170 Yongge Wang, Yvo Desmedt , Mike Burmester : Models For Dependable Computation with Multiple Inputs and Some Hardness Results. Fundam. Inform. 42 (1): 61-73 (2000) Yongge Wang: Resource bounded randomness and computational complexity. Theor. Comput. Sci. 237 (1-2): 33-55 (2000) Yvo Desmedt , Yongge Wang: Approximation Hardness and Secure Communication in Broadcast Channels. ASIACRYPT 1999 : 247-257 Yongge Wang: Linear Complexity versus Pseudorandomness: On Beth and Dai's Result. ASIACRYPT 1999 : 288-298 Yongge Wang, Yvo Desmedt : Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question. EUROCRYPT 1999 : 446-458 Yongge Wang: A Separation of Two Randomness Concepts. Inf. Process. Lett. 69 (3): 115-118 (1999) Mike Burmester , Yvo Desmedt , Yongge Wang: Using Approximation Hardness to Achieve Dependable Computation. RANDOM 1998 : 172-186 Cristian Calude , Peter Hertling , Bakhadyr Khoussainov , Yongge Wang: Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998 : 596-606 Yongge Wang: Genericity, Randomness, and Polynomial-Time Approximations. SIAM J. Comput. 28 (2): 394-408 (1998) Yongge Wang: Randomness, Stochasticity and Approximations. RANDOM 1997 : 213-225 Yongge Wang: NP-Hard Sets are Superterse Unless NP is Small. Inf. Process. Lett. 61 (1): 1-6 (1997) Peter Hertling , Yongge Wang: Invariance Properties of Random Sequences. J. UCS 3 (11): 1241-1249 (1997) Yongge Wang: The Law of the Iterated Logarithm for p-Random Sequences. IEEE Conference on Computational Complexity 1996 : 180-189 Klaus Ambos-Spies , Elvira Mayordomo , Yongge Wang, Xizhong Zheng : Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. STACS 1996 : 63-74 Yongge Wang: NP-hard Sets Are Superterse unless NP Is Small Electronic Colloquium on Computational Complexity (ECCC) 3 (21): (1996) Wolfgang Merkle , Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. MFCS 1995 : 179-190 1 [ 3 ] 2 [ 10 ] [ 16 ] 3 [ 9 ] [ 18 ] 4 [ 28 ] 5 [ 10 ] [ 12 ] [ 14 ] [ 16 ] [ 20 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 31 ] 6 [ 5 ] [ 9 ] [ 18 ] 7 [ 9 ] [ 18 ] 8 [ 29 ] 9 [ 3 ] 10 [ 1 ] [ 19 ] 11 [ 26 ] [ 32 ] [ 33 ] 12 [ 3 ] 13 [ 26 ] [ 27 ] [ 28 ] [ 32 ] [ 33 ]  ©2005 Association for Computing Machinery |
