3,371 research outputs found
Secret-Sharing from Robust Conditional Disclosure of Secrets
A secret-sharing scheme is a method by which a dealer, holding a secret string, distributes shares to parties such that only authorized subsets of parties can reconstruct the secret.
The collection of authorized subsets is called an access structure.
Secret-sharing schemes are an important tool in cryptography and they are used as a building box in many secure
protocols.
In the original constructions of secret-sharing schemes by Ito et al. [Globecom 1987], the share size of each party is (where is the number of parties in the access structure).
New constructions of secret-sharing schemes followed; however, the share size in these schemes remains basically the same.
Although much efforts have been devoted to this problem, no progress was made for more than 30 years.
Recently, in a breakthrough paper, Liu and Vaikuntanathan [STOC 2018] constructed a secret-sharing scheme for a general access structure with share size .
The construction is based on new protocols for conditional disclosure of secrets (CDS).
This was improved by Applebaum et al. [EUROCRYPT 2019] to .
In this work, we construct improved secret-sharing schemes for a general access structure with share size .
Our schemes are linear, that is, the shares are a linear function of the secret and some random elements from a finite field.
Previously, the best linear secret-sharing scheme had shares of size .
Most applications of secret-sharing require linearity. Our scheme is conceptually simpler than previous schemes, using a new reduction to two-party CDS protocols (previous schemes used a reduction to multi-party CDS protocols).
In a CDS protocol for a function , there are parties and a referee; each party holds a private input and a common secret, and sends one message to the referee (without seeing the other messages).
On one hand, if the function applied to the inputs returns , then it is required that the referee, which knows the inputs, can reconstruct the secret from the messages.
On the other hand, if the function applied to the inputs returns , then the referee should get no information on the secret from the messages. However, if the referee gets two messages from a party, corresponding to two different inputs (as happens in our reduction from secret-sharing to CDS), then the referee might be able to reconstruct the secret although it should not.
To overcome this problem, we define and construct -robust CDS protocols, where the referee cannot get any information on the secret when it gets messages for a set of zero-inputs of .
We show that if a function has a two-party CDS protocol with message size , then it has a two-party -robust CDS protocol with normalized message size .
Furthermore, we show that every function has a multi-linear -robust CDS protocol with normalized message size .
We use a variant of this protocol (with slightly larger than ) to construct our improved linear secret-sharing schemes.
Finally, we construct robust -party CDS protocols for
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
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
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
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
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs
The share size of general secret-sharing schemes is poorly understood. The gap between the best known upper bound on the total share size per party of (Applebaum and Nir, CRYPTO 2021) and the best known lower bound of (Csirmaz, J. of Cryptology 1997) is huge (where is the number of parties in the scheme). To gain some understanding on this problem, we study the share size of secret-sharing schemes of almost all access structures, i.e., of almost all collections of authorized sets. This is motivated by the fact that in complexity, many times almost all objects are hardest (e.g., most Boolean functions require exponential size circuits). All previous constructions of secret-sharing schemes were for the worst access structures (i.e., all access structures) or for specific families of access structures.
We prove upper bounds on the share size for almost all access structures. We combine results on almost all monotone Boolean functions (Korshunov, Probl. Kibern. 1981) and a construction of (Liu and Vaikuntanathan, STOC 2018) and conclude that almost all access structures have a secret-sharing scheme with share size .
We also study graph secret-sharing schemes. In these schemes, the parties are vertices of a graph and a set can reconstruct the secret if and only if it contains an edge. Again, for this family there is a huge gap between the upper bounds - (Erdös and Pyber, Discrete Mathematics 1997) - and the lower bounds - (van Dijk, Des. Codes Crypto. 1995). We show that for almost all graphs, the share size of each party is . This result is achieved by using robust 2-server conditional disclosure of secrets protocols, a new primitive introduced and constructed in (Applebaum et al., STOC 2020), and the fact that the size of the maximal independent set in a random graph is small. Finally, using robust conditional disclosure of secrets protocols, we improve the total share size for all very dense graphs
Better Secret-Sharing via Robust Conditional Disclosure of Secrets
A secret-sharing scheme allows to distribute a secret among parties such that only some predefined ``authorized\u27\u27 sets of parties can reconstruct the secret, and all other ``unauthorized\u27\u27 sets learn nothing about . For over 30 years, it was known that any (monotone) collection of authorized sets can be realized by a secret-sharing scheme whose shares are of size and until recently no better scheme was known. In a recent breakthrough, Liu and Vaikuntanathan (STOC 2018) have reduced the share size to , which was later improved to by Applebaum et al. (EUROCRYPT 2019).
In this paper we improve the exponent of general secret-sharing schemes down to . For the special case of linear secret-sharing schemes, we get an exponent of (compared to of Applebaum et al.). As our main building block, we introduce a new \emph{robust} variant of conditional disclosure of secrets (robust CDS) that achieves unconditional security even under bounded form of re-usability. We show that the problem of general secret-sharing schemes reduces to robust CDS protocols with sub-exponential overhead and derive our main result by implementing robust CDS with a non-trivial exponent. The latter construction follows by presenting a general immunization procedure that turns standard CDS into a robust CDS
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
On Competition and the Strategic Management of Intellectual Property in Oligopoly
An innovative firm chooses strategically whether to patent its process innovation or rely on secrecy. By doing so, the firm manages its rival’s beliefs about the size of the innovation, and affects the incentives in the product market. Different measures of competitive pressure in the product market have different effects on the equilibrium patenting choices of an innovative firm with unknown costs and probabilistic patent validity. Increasing the number of firms (degree of product substitutability) gives a smaller (greater) patenting incentive. Switching from Bertrand to Cournot competition gives a smaller (greater) patenting incentive if patent protection is weak (strong).Bertrand and Cournot competition, oligopoly, product differentiation, entry, asymmetric information, strategic disclosure, stochastic patent, trade secret, process innovation, imitation
- …