记录读的几篇文章

1、2021-10-12 Wang, C., Hu, Q., Yu, D., & Cheng, X. (2021, July). Proactive Deployment of Chain-based VNF Backup at the Edge using Online Bandit Learning. In 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS) (pp. 740-750). IEEE.
有关VNF备份如何基于云存储与边缘服务器存储实现利益最大化。

2、2021-10-20 Hu, C., Cheng, X., Tian, Z., Yu, J., & Lv, W. (2021). Achieving privacy preservation and billing via delayed information release. IEEE/ACM Transactions on Networking.
该方案是一种client-server的安全支付方案;
提出了一种新的群签名算法,加密算法用到了Rabin’s public-key cryptosystem与AES(session keys)。

3、2021-11-10 Guan Z, Wan Z, Yang Y, et al. Blockmaze: An efficient privacy-preserving account-model blockchain based on zk-SNARKs[J]. IEEE Transactions on Dependable and Secure Computing, 2020.
基于账户模型的区块链隐私保护方案;
基于zk-SNARK增加零知识余额与零知识转账;
分别保护用户的账户余额信息与转账关系。

4、2021-11-25 Liu T, Xie X, Zhang Y. zkCNN: Zero knowledge proofs for convolutional neural network predictions and accuracy[C]//Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 2021: 2968-2985.
用户A需要借助用户B训练好的模型来训练自己的数据;
但模型对于用户B属于隐私,不愿公开;用户A怀疑用户B是否使用正确的模型;
本文提出zk-CNN基于零知识证明包装卷积神经网络的计算过程。

5、2021-11-29 Fang Z, Darais D, Near J P, et al. Zero Knowledge Static Program Analysis[C]//Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 2021: 2951-2967.
基于零知识证明包装静态程序分析;
在不暴露程序本身的同时证明程序存在一定的特性(Bugs等)。

6、2022-05-03 Tsabary, Itay, et al. “MAD-HTLC: because HTLC is crazy-cheap to attack.” 2021 IEEE Symposium on Security and Privacy (SP). IEEE, 2021.
基于激励机制改善了HTLC协议在异步网络中因为延迟而不能满足原子性的问题;
文中并未指出是异步网络,而是以预防攻击的角度,最终结果大同小异,改善而不是完全解决(因为激励不强制执行)。
UC安全性证明不错,值得学习。

7、2022-05-06 Khalil, Rami, and Arthur Gervais. “Revive: Rebalancing off-blockchain payment networks.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017.
解决了支付通道在初始化后通道内金额不足的问题,主要针对支付通道网络中的环路。

8、2022-05-08 Dziembowski, Stefan, Lisa Eckey, and Sebastian Faust. “Fairswap: How to fairly exchange digital goods.” Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. 2018.
解决了Fair exchange问题(以钱换物,先付钱还是先看物),贡献点在于减少了链上的计算消耗(主要产生于zk),将传统证明信息正确性转化为证明信息不正确。

9、2022-07-19 Dziembowski, Stefan, et al. “Perun: Virtual payment hubs over cryptocurrencies.” 2019 IEEE Symposium on Security and Privacy (SP). IEEE, 2019.
提出虚拟通道,降低Payment Hub给Payment Channel带来的的Gas消耗。

10、2022-07-29 Guo, Y., Wan, Z., Cui, H., Cheng, X., & Dressler, F. (2022). Vehicloak: A Blockchain-Enabled Privacy-Preserving Payment Scheme for Location-Based Vehicular Services. IEEE Transactions on Mobile Computing, (01), 1-13.
去除中心化收费机制,使得用户自己上交收费账单,提出zk-GSigproof,保护用户账单正确性与位置隐私。

11、2022-09-12 Pillai, Babu, et al. “Burn-to-claim: An asset transfer protocol for blockchain interoperability.” Computer Networks 200 (2021): 108495.
去中心化跨链资产转移方案,链中存在Gateway Nodes来实现区块头的存储

12、2022-11-01 Tiancheng Xie, Jiaheng Zhang, Zerui Cheng, Fan Zhang, Yupeng Zhang, Yongzheng Jia and Dawn Song. zkBridge: Trustless Cross-chain Bridges Made Practical. ACM Conference on Computer and Communications Security (CCS), 2022.
跨链桥,提出新的zk方案deVirgo解决聚合效率问题,其次是去除了committee-based validation。

13、2022-11-07 A. Zamyatin, D. Harz, J. Lind, P. Panayiotou, A. Gervais and W. Knottenbelt, “XCLAIM: Trustless, Interoperable, Cryptocurrency-Backed Assets,” 2019 IEEE Symposium on Security and Privacy (SP), 2019.
基于chainRelay解决了传统Cryptocurrency-Backed Assets跨链转移过程中vault过于中心化的问题。

14、2022-11-25 Yin, Zeyuan, et al. “Bool Network: An Open, Distributed, Secure Cross-Chain Notary Platform.” IEEE Transactions on Information Forensics and Security 17 (2022): 3465-3478.
解决跨链场景的分布式网络验证节点的隐私问题。

15、2022-12-07 Thyagarajan, Sri AravindaKrishnan, Giulio Malavolta, and Pedro Moreno-Sanchez. “Universal atomic swaps: Secure exchange of coins across all blockchains.” 2022 IEEE Symposium on Security and Privacy (SP). IEEE, 2022.
基于VTS(Verifiable timed signature)技术来代替时间锁对script机制的依赖,因此具有通用性;多对多交易

16、2023-03-22 Deshpande, Apoorvaa, and Maurice Herlihy. “Privacy-preserving cross-chain atomic swaps.” Financial Cryptography and Data Security: FC 2020 International Workshops, AsiaUSEC, CoDeFi, VOTING, and WTSC, Kota Kinabalu, Malaysia, February 14, 2020, Revised Selected Papers. Cham: Springer International Publishing, 2020.
针对HTLC的隐私问题提出了解决方案,定义了一些隐私的概念,抽象化了基于Schnorr Signature的隐私保护方法。

17、2023-03-28 Malavolta, Giulio, et al. “Concurrency and privacy with payment-channel networks.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017.
解决了PCN网络中存在的隐私泄露问题以及提高该网络的并行处理能力。隐私问题主要指的是PCN一条路线上使用相同s造成的路径泄露的问题。

18、2023-06-29 Oguzhan Ersoy et al. “Get Me out of This Payment! Bailout: An HTLC Re-routing Protocol.” Financial Cryptography and Data Security 2023.
解决PCN中途有人退出的问题,思路是找个新的路径来代替原路径。

19、2023-06-29 Zicong Hong et al. “GriDB: Scaling Blockchain Database via Sharding and Off-Chain Cross-Shard Mechanism.” Proc. VLDB Endow. 16, 7 (March 2023), 1685–1698.
将分片中复杂的工作部分,例如跨分片,放在链下去完成。

20、2023-07-01 Alikhani, Pouriya, et al. “Experimental relativistic zero-knowledge proofs.” Nature 599.7883 (2021): 47-50.
零知识证明的一个现实用例。

21、2023-07-11 Wadhwa, Sarisht, et al. “He-HTLC: Revisiting Incentives in HTLC.” Cryptology ePrint Archive (2022).
基于MAD-HTLC, 考虑了矿工会主动攻击的情况。

22、Guo, Yihao, et al. “Cross-channel: Scalable off-chain channels supporting fair and atomic cross-chain operations.” IEEE Transactions on Computers (2023).
提出跨链通道来提高跨链可扩展性,同时考虑了通道内金额不能花费以及公平交换问题。

23、Jia, Xiaofeng, et al. “Cross-chain virtual payment channels.” IEEE Transactions on Information Forensics and Security (2023).
提出虚拟跨链通道来解决跨链可扩展性与中心化问题。

24、Scaffino, Giulia, et al. “Alba: The Dawn of Scalable Bridges for Blockchains.” Cryptology ePrint Archive (2024).
闪电网络与以太坊之间的跨链交互,似乎与以上通道技术解决问题一样。

25、Luo, Xinyi, et al. “CrossChannel: Efficient and Scalable Cross-Chain Transactions Through Cross-and-Off-Blockchain Micropayment Channel.” IEEE Transactions on Dependable and Secure Computing (2024).
中继节点+链下通道来实现高效跨链,并且相比HTLC不需要用户在两条链都有账户;是否考虑中继节点的可信性问题?

  • 1
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 2
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值