2008 |
45 | EE | Yongge Wang,
Yvo Desmedt:
Perfectly Secure Message Transmission Revisited.
IEEE Transactions on Information Theory 54(6): 2582-2595 (2008) |
2007 |
44 | EE | Xintao Wu,
Yongge Wang,
Songtao Guo,
Yuliang Zheng:
Privacy Preserving Database Generation for Database Application Testing.
Fundam. Inform. 78(4): 595-612 (2007) |
2006 |
43 | EE | Yvo Desmedt,
Yongge Wang,
Mike Burmester:
Revisiting Colored Networks and Privacy Preserving Censorship.
CRITIS 2006: 140-150 |
42 | EE | Qiaofang 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) |
41 | EE | Zhu 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 |
40 | EE | Yvo Desmedt,
Yongge Wang,
Reihaneh Safavi-Naini,
Huaxiong Wang:
Radio Networks with Reliable Communication.
COCOON 2005: 156-166 |
39 | EE | Yongge Wang,
Xintao Wu:
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation.
ICDM 2005: 482-489 |
38 | EE | Xintao Wu,
Chintan Sanghvi,
Yongge Wang,
Yuliang Zheng:
Privacy Aware Data Generation for Testing Database Applications.
IDEAS 2005: 317-326 |
37 | EE | Yvo Desmedt,
Yongge Wang,
Mike Burmester:
A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback.
ISAAC 2005: 277-287 |
36 | EE | Xintao 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 |
34 | EE | Yuliang Zheng,
Yongge Wang:
Efficient and provably secure ciphers for storage device block level encryption.
StorageSS 2005: 103-107 |
2004 |
33 | EE | Yongge Wang,
Xintao Wu,
Yuliang Zheng:
Privacy Preserving Data Generation for Database Application Performance Testing.
TrustBus 2004: 142-151 |
32 | EE | 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) |
31 | EE | Yongge 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 |
28 | EE | Yongge Wang,
Yuliang Zheng:
Fast and Secure Magnetic WORM Storage Systems.
IEEE Security in Storage Workshop 2003: 11-19 |
27 | EE | Xintao Wu,
Yongge Wang,
Yuliang Zheng:
Privacy preserving database application testing.
WPES 2003: 118-128 |
2002 |
26 | EE | Yvo Desmedt,
Yongge Wang:
Maximum Flows and Critical Vertices in AND/OR Graphs.
COCOON 2002: 238-248 |
25 | EE | Yvo Desmedt,
Yongge Wang:
Perfectly Secure Message Transmission Revisited.
EUROCRYPT 2002: 502-517 |
24 | EE | Yvo Desmedt,
Yongge Wang:
Efficient Zero-Knowledge Proofs for Some Practical Graph Problems.
SCN 2002: 290-302 |
23 | EE | Yongge Wang:
The algebraic structure of the isomorphic types of tally, polynomial time computable sets.
Arch. Math. Log. 41(3): 215-244 (2002) |
22 | EE | Yvo Desmedt,
Yongge Wang:
Perfectly Secure Message Transmission Revisited
CoRR cs.CR/0208041: (2002) |
21 | EE | Yongge Wang:
A comparison of two approaches to pseudorandomness.
Theor. Comput. Sci. 276(1-2): 449-459 (2002) |
2001 |
20 | EE | Yongge Wang,
Yvo Desmedt:
Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question.
J. Cryptology 14(2): 121-135 (2001) |
19 | EE | Wolfgang Merkle,
Yongge Wang:
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities.
Math. Log. Q. 47(2): 249-269 (2001) |
18 | EE | Cristian 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) |
15 | EE | Yongge 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 |
12 | EE | Yongge Wang,
Yvo Desmedt:
Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question.
EUROCRYPT 1999: 446-458 |
11 | EE | Yongge Wang:
A Separation of Two Randomness Concepts.
Inf. Process. Lett. 69(3): 115-118 (1999) |
1998 |
10 | EE | Mike 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 |
6 | EE | Yongge Wang:
NP-Hard Sets are Superterse Unless NP is Small.
Inf. Process. Lett. 61(1): 1-6 (1997) |
5 | EE | Peter Hertling,
Yongge Wang:
Invariance Properties of Random Sequences.
J. UCS 3(11): 1241-1249 (1997) |
1996 |
4 | EE | Yongge 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 |
2 | EE | Yongge 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 |