Minimum Disclosure Proofs of Knowledge
نویسندگان
چکیده
Protocols are given for allowing a “prover” to convince a “verifier” that the prover knows some verifiable secret information, without allowing the verifier to learn anything about the secret. The secret can be probabilistically or deterministically verifiable, and only one of the prover or the verifier need have constrained resources. This paper unifies and extends models and techniques previously put forward by the authors, and compares some independent related work. c 1988 Academic Press, Inc.
منابع مشابه
Working Paper ENGLISH ONLY UNITED NATIONS ECONOMIC COMMISSION FOR EUROPE (UNECE) CONFERENCE OF EUROPEAN STATISTICIANS EUROPEAN COMMISSION STATISTICAL OFFICE OF THE EUROPEAN
Minimum distance controlled tabular adjustment (CTA) is a recent perturbative approach for statistical disclosure control in tabular data. CTA looks for the closest safe table, using some particular distance. In this talk we provide empirical results to assess the disclosure risk of the method. A set of 33 instances from the literature and four different attacker scenarios are considered. The r...
متن کاملAchieving Trust without Disclosure: Dark Pools and a Role for Secrecy-Preserving Verification
Can an exchange be “dark,” so that orders are not displayed, while simultaneously trustworthy, so that the execution of trades and flow of information occur as promised? SEC actions against dark pools suggest cause for concern, and regulators seem to be moving towards requiring more disclosure. Yet there is a clear tension: trading order information is widely exploited. Therefore, institutional...
متن کاملOn Assessing the Disclosure Risk of Controlled Adjustment Methods for Statistical Tabular Data
Minimum distance controlled tabular adjustment is a recent perturbative approach for statistical disclosure control in tabular data. Given a table to be protected, it looks for the closest safe table, using some particular distance. Controlled adjustment is known to provide high data utility. However, the disclosure risk has only been partially analyzed using theoretical results from optimizati...
متن کاملTesting Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we consider the above problem in the setting where Alice and Bob wish to disclose no information to each other about their sets beyond the single bit: “whether the intersection is empty or not.” This problem has many app...
متن کاملOn Computing Minimum Unsatisfiable Cores
Certifying a SAT solver for unsatisfiable instances is a computationally hard problem. Nevertheless, in the utilization of SAT in industrial settings, one often needs to be able to generate unsatisfiability proofs, either to guarantee the correctness of the SAT solver or as part of the utilization of SAT in some applications (e.g. in model checking). As part of the process of generating unsatis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 37 شماره
صفحات -
تاریخ انتشار 1988