Attribute-Based Signatures for Circuits from Bilinear Map
From MaRDI portal
Publication:2798779
DOI10.1007/978-3-662-49384-7_11zbMath1388.94076OpenAlexW2295625707MaRDI QIDQ2798779
Nuttapong Attrapadung, Goichiro Hanaoka, Yusuke Sakai
Publication date: 13 April 2016
Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_11
Related Items (10)
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ Enhanced Security of Attribute-Based Signatures ⋮ Attribute-based signatures for range of inner product and its applications ⋮ Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs ⋮ Efficient attribute-based signature for monotone predicates ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Predicate signatures from pair encodings via dual system proof technique ⋮ Policy controlled system with anonymity ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Confluence Reduction for Markov Automata
- Analysis of Timed and Long-Run Objectives for Markov Automata
- Static prediction of heap space usage for first-order functional programs
- Denotational cost semantics for functional languages with inductive types
- Stochastic Processes with Applications
- Modelling and Analysis of Markov Reward Automata
- SPEED
- Towards automatic resource bound analysis for OCaml
- Multivariate amortized resource analysis
This page was built for publication: Attribute-Based Signatures for Circuits from Bilinear Map
