In this work we revisit the fundamental findings by Chen et al. in [5] on general information transfer in linear ramp secret sharing schemes to conclude that their method not only gives a way to establish worst case leakage [5, 25] and best case recovery [5, 19], but can also lead to additional insight on non-qualifying sets for any prescribed amount of information. We then apply this insight to schemes defined from monomial-Cartesian codes and by doing so we demonstrate that the good schemes from Sec.\ IV in [14] have a second layer of security. Elaborating further, when given a designed recovery number, in a new construction the focus is entirely on ensuring that the access structure possesses desirable second layer security, rather on what is the worst case information leakage in terms of number of participants.The particular structure of largest possible sets being not able to determine any amount of information suggests that we coin the concept of considerate ramp secret sharing schemes of which the proposed new construction is a well-structured example

翻译：在本研究中，我们重新审视了Chen等人在文献[5]中关于线性斜坡秘密共享方案中一般信息传递的基本结论，指出他们的方法不仅能够建立最坏情况下的信息泄露[5,25]和最佳情况下的信息恢复[5,19]，还能为任意预设信息量下的非授权集合提供额外洞见。随后，我们将这一洞见应用于由单项式笛卡尔码定义的方案，并由此证明文献[14]第四节中的优良方案具有第二层安全性。进一步阐述，当给定设计恢复阈值时，新构建方案完全聚焦于确保访问结构具备理想的第二层安全性，而非关注以参与者数量衡量的最坏情况信息泄露。最大可能集合无法确定任何信息量的特殊结构，促使我们提出"考虑周到的斜坡秘密共享方案"这一概念，而所提出的新构建方案正是其结构良好的范例。