Be Adaptive, Avoid Overcommitting

Jafargholi, Zahra; Kamath, Chethan; Klein, Karen; Komargodski, Ilan; Pietrzak, Krzysztof; Wichs, Daniel

doi:10.1007/978-3-319-63688-7_5

Cited by 40 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, our schemes employ a secret sharing scheme where the number of shares corresponds to only the number of input wires. Their framework derives from the technique to prove the adaptive security of secret sharing for monotone circuits by Jafargholi et al [21], which requires the same number of shares as in KW19. We guess that this is why their construction employs such a secret sharing scheme.…”

Section: Number Of Sharesmentioning

confidence: 99%

“…Here, we briefly recall the piecewise guessing framework by Kowalczyk and Wee [25], which is based on the framework by Jafargholi et al [21]. The framework helps us to prove adaptive security of cryptographic schemes that are selectively secure.…”

Section: Piecewise Guessing Frameworkmentioning

confidence: 99%

“…Clearly, the number of shares for formula f corresponds to the number of its input wires. The secret sharing scheme employed by Kowalczyk and Wee is different from ours [21], where the number of shares corresponds to the summation of the numbers of input wires and gates in f . We show that we can utilize their framework even if we replace the secret sharing scheme to ours.…”

Section: Linear Secret Sharing For Boolean Formulaementioning

confidence: 99%

See 2 more Smart Citations

Fast, compact, and expressive attribute-based encryption

Tomida

Kawahara

Nishimaki

2021

Des. Codes Cryptogr.

View full text Add to dashboard Cite

Attribute-based encryption (ABE) is an advanced cryptographic tool and useful to build various types of access control systems. Toward the goal of making ABE more practical, we propose key-policy (KP) and ciphertext-policy (CP) ABE schemes, which first support unbounded sizes of attribute sets and policies with negation and multi-use of attributes, allow fast decryption, and are adaptively secure under a standard assumption, simultaneously. Our schemes are more expressive than previous schemes and efficient enough. To achieve the adaptive security along with the other properties, we refine the technique introduced by Kowalczyk and Wee (Eurocrypt'19) so that we can apply the technique more expressive ABE schemes. Furthermore, we also present a new proof technique that allows us to remove redundant elements used in their ABE schemes. We implement our schemes in 128-bit security level and present their benchmarks for an ordinary personal computer and smartphones. They show that all algorithms run in one second with the personal computer when they handle any policy or attribute set with one hundred attributes. KeywordsAttribute-based encryption • Standard assumption • Non-monotone • Unbounded • Multi-use • Random oracle model Mathematics Subject Classification 94A60 Communicated by M. Paterson.

show abstract

Section: Number Of Sharesmentioning

confidence: 99%

Section: Piecewise Guessing Frameworkmentioning

confidence: 99%

Section: Linear Secret Sharing For Boolean Formulaementioning

confidence: 99%

See 1 more Smart Citation

Fast, compact, and expressive attribute-based encryption

Tomida

Kawahara

Nishimaki

2021

Des. Codes Cryptogr.

View full text Add to dashboard Cite

show abstract

“…We name our scheme S2. It combines the folklore idea of Yao's secret-sharing scheme [3,28,42] with Benaloh-and-Leichter's scheme for monotone formulas [16]. The reason we call Yao's scheme "folklore" is because there is no written description of it by him.…”

Section: B Base-level Scheme S2mentioning

confidence: 99%

Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements

Bellare

Dai

Rogaway

2020

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

Aiming to strengthen classical secret-sharing to make it a more directly useful primitive for human endusers, we develop definitions, theorems, and efficient constructions for what we call adept secret-sharing. Our primary concerns are the properties we call privacy, authenticity, and error correction. Privacy strengthens the classical requirement by ensuring maximal confidentiality even if the dealer does not employ fresh, uniformly random coins with each sharing. That might happen either intentionally—to enable reproducible secretsharing— or unintentionally, when an entropy source fails. Authenticity is a shareholder’s guarantee that a secret recovered using his or her share will coincide with the value the dealer committed to at the time the secret was shared. Error correction is the guarantee that recovery of a secret will succeed, also identifying the valid shares, exactly when there is a unique explanation as to which shares implicate what secret. These concerns arise organically from a desire to create general-purpose libraries and apps for secret sharing that can withstand both strong adversaries and routine operational errors.

show abstract

“…Recently, Tomida et al [26] and Kowalczyk et al [27] proposed ABE schemes that address the problem of one-use restriction of attributes in access policy. e schemes were built on a piecewise guessing framework developed in [28], and they proved adaptive security of the ABE constructions with some polynomial security losses. Nonetheless, these schemes do not directly support span programs (linear secret sharing scheme matrix) to express policies.…”

Section: Related Workmentioning

confidence: 99%

A Fully Secure KP-ABE Scheme on Prime-Order Bilinear Groups through Selective Techniques

Obiri

Xia

et al. 2020

Security and Communication Networks

View full text Add to dashboard Cite

Key-policy attribute-based encryption (KP-ABE) is the cryptographic primitive which enables fine grained access control while still providing end-to-end encryption. Although traditional encryption schemes can provide end-to-end encryption, users have to either share the same decryption keys or the data have to be stored in multiple instances which are encrypted with different keys. Both of these options are undesirable. However, KP-ABE can provide less key overhead compared to the traditional encryption schemes. While there are a lot of KP-ABE schemes, none of them simultaneously supports multiuse of attributes, adaptive security, monotone span programs, and static security assumption. Hence, we propose a fully secure KP-ABE scheme for monotone span programs in prime-order group. This scheme uses selective security proof techniques to obtain the requisite ingredients for full security proof. This strengthens the correlation between selective and full security models and enables the transition of the best qualities in selective security models to fully secure systems. The security proof is based on decisional linear assumption and three-party Diffie–Hellman assumption.

show abstract

Be Adaptive, Avoid Overcommitting

Cited by 40 publications

References 27 publications

Fast, compact, and expressive attribute-based encryption

Fast, compact, and expressive attribute-based encryption

Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements

A Fully Secure KP-ABE Scheme on Prime-Order Bilinear Groups through Selective Techniques

Contact Info

Product

Resources

About