| Collaborative topic regression with social regularization for tag recommendation H Wang, B Chen, WJ Li Twenty-Third International Joint Conference on Artificial Intelligence, 2013 | 149 | 2013 |
| Scrypt is maximally memory-hard J Alwen, B Chen, K Pietrzak, L Reyzin, S Tessaro Annual International Conference on the Theory and Applications of …, 2017 | 80 | 2017 |
| Oblivious parallel RAM: improved efficiency and generic constructions B Chen, H Lin, S Tessaro Theory of Cryptography Conference, 205-234, 2016 | 64 | 2016 |
| On the complexity of scrypt and proofs of space in the parallel random oracle model J Alwen, B Chen, C Kamath, V Kolmogorov, K Pietrzak, S Tessaro Annual International Conference on the Theory and Applications of …, 2016 | 38 | 2016 |
| Memory-hard functions from cryptographic primitives B Chen, S Tessaro Annual International Cryptology Conference, 543-572, 2019 | 9 | 2019 |
| Continuous space-bounded non-malleable codes from stronger proofs-of-space B Chen, Y Chen, K Hostáková, P Mukherjee Annual International Cryptology Conference, 467-495, 2019 | 7 | 2019 |
| Mechanism design for daily deals B Chen, T Qin, TY Liu Proceedings of the 2015 international conference on autonomous agents and …, 2015 | 5 | 2015 |
| -anonymous Signaling Scheme B Chen, T Qin, TY Liu arXiv preprint arXiv:1311.6638, 2013 | 1 | 2013 |
| Continuous space-bounded non-malleable codes from stronger proofs-of-space P Mukherjee, B Chen, C Yilei US Patent App. 17/534,104, 2022 | | 2022 |
| Continuous space-bounded non-malleable codes from stronger proofs-of-space P Mukherjee, B Chen, C Yilei US Patent 11,212,103, 2021 | | 2021 |
| Memory-Hard Functions: When Theory Meets Practice B Chen UC Santa Barbara, 2019 | | 2019 |
