113,053 research outputs found
Joshua Davis: Author of Spare Parts
Citation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
Japan is Back: Abe, Governance, Abenomics, and Abe Foreign Policy
Webcast sponsored by the Irving K. Barber Learning Centre. Discussants: KOJO Yoshiko (Univ of Tokyo); KUME Ikuo, (Waseda Univ/Institute of European Studies, UBC); Yves TIBERGHIEN (IAR, UBC); UCHIYAMA Yu (Univ of Tokyo). How will Shinzō Abe take advantage of his recent electoral victory to move forward with his domestic and international agendas? Informed experts, including six distinguished Japanese analysts, will consider the prospects for Abe economics, for constitutional reform, and for relations with regional powers.Arts, Faculty ofAsian Studies, Department ofUnreviewedFacult
Steven Johnson Author Talk Poster
K-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
Succinct and Adaptively Secure ABE for ABP from k-Lin
We present *succinct* and *adaptively secure* attribute-based encryption (ABE)
schemes for *arithmetic branching programs*, based on k-Lin in pairing groups.
Our key-policy ABE scheme has ciphertexts of *constant size*, independent of
the length of the attributes, and our ciphertext-policy ABE scheme has secret
keys of *constant size*. Our schemes improve upon the recent succinct ABE
schemes in [Attrapadung and Tomida, Asiacrypt \u2720], which only handle Boolean
formulae. All other prior succinct ABE schemes either achieve only selective
security or rely on -type assumptions.
Our schemes are obtained through a general and modular approach that combines
a public-key inner-product functional encryption satisfying a new security
notion called gradual simulation security and an information-theoretic
randomized encoding scheme called arithmetic key garbling scheme
Compact Adaptively Secure ABE for NC1 from k-Lin
We present compact attribute-based encryption (ABE) schemes for NC1 that are adaptively secure under the k-Lin assumption with polynomial security loss. Our KP-ABE scheme achieves ciphertext size that is linear in the atttribute length and independent of the policy size even in the many-use setting, and we achieve an analogous efficiency guarantee for CP-ABE. This resolves the central open problem posed by Lewko and Waters (CRYPTO 2011). Previous adaptively secure constructions either impose an attribute ``one-use restriction\u27\u27 (or the ciphertext size grows with the policy size), or require q-type assumptions
ABE for DFA from k-Lin
International audienceWe present the first attribute-based encryption (ABE) scheme for deterministic finite automaton (DFA) based on static assumptions in bilinear groups; this resolves an open problem posed by Waters (CRYPTO 2012). Our main construction achieves selective security against unbounded collusions under the standard k-linear assumption in prime-order bilinear groups, whereas previous constructions all rely on q-type assumptions
- …
