2,614 research outputs found
An Economic Analysis of Privacy Protection and Statistical Accuracy as Social Choices
Statistical agencies face a dual mandate to publish accurate statistics while protecting respondent privacy. Increasing privacy protection requires decreased accuracy. Recognizing this as a resource allocation problem, we propose an economic solution: operate where the marginal cost of increasing privacy equals the marginal benefit. Our model of production, from computer science, assumes data are published using an efficient differentially private algorithm. Optimal choice weighs the demand for accurate statistics against the demand for privacy. Examples from U.S. statistical programs show how our framework can guide decision-making. Further progress requires a better understanding of willingness-to-pay for privacy and statistical accuracy
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
In the conditional disclosure of secrets (CDS) problem (Gertner et al., J. Comput. Syst. Sci., 2000) Alice and Bob, who hold n-bit inputs x and y respectively, wish to release a common secret z to Carol (who knows both x and y) if and only if the input (x,y) satisfies some predefined predicate f. Alice and Bob are allowed to send a single message to Carol which may depend on their inputs and some shared randomness, and the goal is to minimize the communication complexity while providing information-theoretic security.
Despite the growing interest in this model, very few lower-bounds are known. In this paper, we relate the CDS complexity of a predicate f to its communication complexity under various communication games. For several basic predicates our results yield tight, or almost tight, lower-bounds of Omega(n) or Omega(n^{1-epsilon}), providing an exponential improvement over previous logarithmic lower-bounds.
We also define new communication complexity classes that correspond to different variants of the CDS model and study the relations between them and their complements. Notably, we show that allowing for imperfect correctness can significantly reduce communication - a seemingly new phenomenon in the context of information-theoretic cryptography. Finally, our results show that proving explicit super-logarithmic lower-bounds for imperfect CDS protocols is a necessary step towards proving explicit lower-bounds against the class AM, or even AM cap coAM - a well known open problem in the theory of communication complexity. Thus imperfect CDS forms a new minimal class which is placed just beyond the boundaries of the "civilized" part of the communication complexity world for which explicit lower-bounds are known
One-One Constrained Pseudorandom Functions
We define and study a new cryptographic primitive, named One-One Constrained Pseudorandom Functions. In this model there are two parties, Alice and Bob, that hold a common random string K, where Alice in addition holds a predicate f:[N] ? {0,1} and Bob in addition holds an input x ? [N]. We then let Alice generate a key K_f based on f and K, and let Bob evaluate a value K_x based on x and K. We consider a third party that sees the values (x,f,K_f) and the goal is to allow her to reconstruct K_x whenever f(x)=1, while keeping K_x pseudorandom whenever f(x)=0. This primitive can be viewed as a relaxation of constrained PRFs, such that there is only a single key query and a single evaluation query.
We focus on the information-theoretic setting, where the one-one cPRF has perfect correctness and perfect security. Our main results are as follows.
1) A Lower Bound. We show that in the information-theoretic setting, any one-one cPRF for punctured predicates is of exponential complexity (and thus the lower bound meets the upper bound that is given by a trivial construction). This stands in contrast with the well known GGM-based punctured PRF from OWF, which is in particular a one-one cPRF. This also implies a similar lower bound for all NC1.
2) New Constructions. On the positive side, we present efficient information-theoretic constructions of one-one cPRFs for a few other predicate families, such as equality predicates, inner-product predicates, and subset predicates. We also show a generic AND composition lemma that preserves complexity.
3) An Amplification to standard cPRF. We show that all of our one-one cPRF constructions can be amplified to a standard (single-key) cPRF via any key-homomorphic PRF that supports linear computations. More generally, we suggest a new framework that we call the double-key model which allows to construct constrained PRFs via key-homomorphic PRFs.
4) Relation to CDS. We show that one-one constrained PRFs imply conditional disclosure of secrets (CDS) protocols. We believe that this simple model can be used to better understand constrained PRFs and related cryptographic primitives, and that further applications of one-one constrained PRFs and our double-key model will be found in the future, in addition to those we show in this paper
Mental Card Gaming Protocols Supportive Of Gameplay Versatility, Robustness And Efficiency
Pennainan kad mental merupakan protokol kriptografi yang membolehkan pennainan yang
~
disahkan adil di kalangan parti-parti jauh yang penyangsi dan berpotensi menipu. Pennainan
kad ini setidak-tidaknya patut menyokong-tanpa memperkenal~an parti ketiga yang dipercayai
(TTP)--rahsia kad, pengesanan penipuan dan keselamatan bersyarat ke atas pakatan pemain.
Tambahan kepada keperJuan asas ini, kami meninjau isu-isu pennainan kad mental yang
berkaitan dengan fungsian permainan, keteguhan operasional dan kecekapan implementasi.
Pengkajian kami diberangsang oleh potensi pennainan berasaskan komputer dan rangkaian yang
melewati batas kemampuan kad fizikal, terutamanya pembongkaran maklumat terperinci kad
(seperti warna, darjat, simbol atau kebangsawanan) sambil merahsiakan nilai keseluruhan kad
tersebut.
~.
Mental card games are cryptographic protocols which permit verifiably fair gameplay among a
l<
~.
priori distrustful and potentially untrustworthy remote parties and should minimally providewithout
the introduction of a trusted third party (TTP)---for card confidentiality, fraud detection
and conditional security against collusion. In addition to these basic requirements, we explore
into gameplay functionality, operational robustness and implementation efficiency issues of
mental card gaming. Our research is incited by the potential of computer-based and networkmediated
gameplay beyond the capability of physical cards, particularly fine-grained
information disclosure (such as colour, rank, symbol or courtliness) with preservation of card
secrecy. On the other hand, being network connected renders the protocol susceptible to
(accidental or intentional) disconnection attack, as well as other malicious behaviours
An Economic Analysis of Privacy Protection and Statistical Accuracy as Social Choices
Statistical agencies face a dual mandate to publish accurate statistics while
protecting respondent privacy. Increasing privacy protection requires decreased
accuracy. Recognizing this as a resource allocation problem, we propose an
economic solution: operate where the marginal cost of increasing privacy equals
the marginal benefit. Our model of production, from computer science, assumes
data are published using an efficient differentially private algorithm. Optimal
choice weighs the demand for accurate statistics against the demand for
privacy. Examples from U.S.\ statistical programs show how our framework can
guide decision-making. Further progress requires a better understanding of
willingness-to-pay for privacy and statistical accuracy.Comment: Forthcoming in American Economic Revie
Quadratic Secret Sharing and Conditional Disclosure of Secrets
There is a huge gap between the upper and lower bounds on the share size of secret-sharing schemes for arbitrary -party access structures, and consistent with our current knowledge the optimal share size can be anywhere between polynomial in and exponential in . For linear secret-sharing schemes, we know that the share size for almost all -party access structures must be exponential in . Furthermore, most constructions of efficient secret-sharing schemes are linear. We would like to study larger classes of secret-sharing schemes with two goals. On one hand, we want to prove lower bounds for larger classes of secret-sharing schemes, possibly shedding some light on the share size of general secret-sharing schemes. On the other hand, we want to construct efficient secret-sharing schemes for access structures that do not have efficient linear secret-sharing schemes. Given this motivation, Paskin-Cherniavsky and Radune (ITC\u2720) defined and studied a new class of secret-sharing schemes in which the shares are generated by applying degree- polynomials to the secret and some random field elements. The special case corresponds to linear and multi-linear secret-sharing schemes.
We define and study two additional classes of polynomial secret-sharing schemes: (1) schemes in which for every authorized set the reconstruction of the secret is done using polynomials and (2) schemes in which both sharing and reconstruction are done by polynomials. For linear secret-sharing schemes, schemes with linear sharing and schemes with linear reconstruction are equivalent. We give evidence that for polynomial secret-sharing schemes, schemes with polynomial sharing are probably stronger than schemes with polynomial reconstruction. We also prove lower bounds on the share size for schemes with polynomial reconstruction. On the positive side, we provide constructions of secret-sharing schemes and conditional disclosure of secrets (CDS) protocols with quadratic sharing and reconstruction. We extend a construction of Liu et al. (CRYPTO\u2717) and construct optimal quadratic -server CDS protocols for functions f:[N]^k\rightarrow \{0,\1} with message size . We show how to transform our quadratic -server CDS protocol to a robust CDS protocol, and use the robust CDS protocol to construct quadratic secret-sharing schemes for arbitrary access structures with share size ; this is better than the best known share size of for linear secret-sharing schemes and worse than the best known share size of for general secret-sharing schemes
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols
In a -party CDS protocol, each party sends one message to a referee (without seeing the other messages) such that the referee will learn a secret held by the parties if and only if the inputs of the parties satisfy some condition (e.g., if the inputs are all equal). This simple primitive is used to construct attribute based encryption, symmetrically-private information retrieval, priced oblivious transfer, and secret-sharing schemes for any access structure. Motivated by these applications, CDS protocols have been recently studied in many papers. In this work, we study linear CDS protocols, where each of the messages of the parties is a linear function of the secret and random elements taken from some finite field. Linearity is an important property of CDS protocols as many applications of CDS protocols required it.
Our main result is a construction of linear -party CDS protocols for an arbitrary function with messages of size . By a lower bound of Beimel et al. [TCC 2017], this message size is optimal. We also consider functions with few inputs that return one, and design more efficient CDS protocols for them.
CDS protocols can be used to construct secret-sharing schemes for uniform access structures, where for some all sets of size less than are unauthorized, all sets of size greater than are authorized, and each set of size can be either authorized or unauthorized. We show that our results imply that every -uniform access structure with parties can be realized by a linear secret-sharing scheme with share size . Furthermore, the linear -party CDS protocol with messages of size was recently used by Liu and Vaikuntanathan [STOC 2018] to construct a linear secret-sharing scheme with share size for any -party access structure
Relating non-local quantum computation to information theoretic cryptography
Non-local quantum computation (NLQC) is a cheating strategy for
position-verification schemes, and has appeared in the context of the AdS/CFT
correspondence. Here, we connect NLQC to the wider context of information
theoretic cryptography by relating it to a number of other cryptographic
primitives. We show one special case of NLQC, known as -routing, is
equivalent to the quantum analogue of the conditional disclosure of secrets
(CDS) primitive, where by equivalent we mean that a protocol for one task gives
a protocol for the other with only small overhead in resource costs. We further
consider another special case of position verification, which we call coherent
function evaluation (CFE), and show CFE protocols induce similarly efficient
protocols for the private simultaneous message passing (PSM) scenario. By
relating position-verification to these cryptographic primitives, a number of
results in the cryptography literature give new implications for NLQC, and vice
versa. These include the first sub-exponential upper bounds on the worst case
cost of -routing of entanglement, the first example
of an efficient -routing strategy for a problem believed to be outside
, linear lower bounds on entanglement for CDS in the quantum setting,
linear lower bounds on communication cost of CFE, and efficient protocols for
CDS in the quantum setting for functions that can be computed with quantum
circuits of low depth
- …