64
Voted
IPL
2016
10 years 3 months ago
2016
We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j giv...
84
Voted
IPL
2016
10 years 3 months ago
2016
83
Voted
IPL
2016
10 years 3 months ago
2016
Compressed Sensing based encryption is computationally secure in a one time key scenario, but it does not resist chosen plaintext attacks (CPA) due to the deterministic encryption...
60
Voted
IPL
2016
10 years 3 months ago
2016
We show that the Kth largest subset problem and the Kth largest m-tuple problem are in PP and hard for PP under polynomial-time Turing reductions. Several problems from the litera...
58
Voted
IPL
2016
10 years 3 months ago
2016
Bitcoin supports complex transactions where the recipient of a transaction can be programmatically determined. Using these transactions, multiparty computation protocols that aim ...