[PDF] Top 20 Efficient (Anonymous) Compact HIBE From Standard Assumptions
Has 10000 "Efficient (Anonymous) Compact HIBE From Standard Assumptions" found on our website. Below are the top 20 most common "Efficient (Anonymous) Compact HIBE From Standard Assumptions".
Efficient (Anonymous) Compact HIBE From Standard Assumptions
... a HIBE scheme, an individual entity can obtain a private key from either the PKG or from a lower-level ...entity from which it obtains the private key. As a result, identities in a HIBE ... See full document
28
Anonymous Constant-Size Ciphertext HIBE From Asymmetric Pairings
... most efficient bilinear pairings, namely, Type-3 ...is anonymous. The HIBE is obtained by extending an asymmetric pairing based IBE scheme due to Lewko and ...resulting HIBE is the only known ... See full document
21
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
... the standard model (without the ran- dom oracle idealization), the most efficient constructions rely on the Groth-Sahai proof systems (Euro- ...theoretic assumptions (a.k.a. “simple ... See full document
53
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of an HMAC Assumption
... Our treatment is concrete rather than asymptotic. For any security goal for a primitive, for example prf security of a function family, we define an advantage metric, in this case the prf advantage of an adversary ... See full document
17
On Publicly Verifiable Delegation From Standard Assumptions
... highly efficient, applies to a wide class of protocols, and uses a random CRS with no ...interaction from any public- coin interactive proof assuming the existence of a fully homomorphic encryption scheme ... See full document
33
G-Merkle: A Hash-Based Group Signature Scheme From Standard Assumptions
... Table 1 shows the performance data of the G-Merkle inner processes. We fix N = 64 as the number of group members (also called users) to facilitate the comparison of dif- ferent tree heights (but other values are ... See full document
20
Fully, (Almost) Tightly Secure IBE from Standard Assumptions
... and HIBE schemes that are secure in the standard model based on pairings [9, 5, 6, 28, 15, 29] as well as lattices [16, 10, 2, ...very efficient constructions of IBE based on standard ... See full document
34
Robustly Reusable Fuzzy Extractor from Standard Assumptions
... required that there are many lossy tags and with a trapdoor one can efficiently sample a lossy tag. Additionally, LAF has two more properties named evasive- ness and indistinguishability. Evasiveness demands that without ... See full document
35
Weakly Secure Equivalence-Class Signatures from Standard Assumptions
... [AGHO11] allow for more efficient schemes in that parts of the signature can, after randomization, be given in the clear. However, for privacy-preserving appli- cations, they still inherently require hiding the ... See full document
31
Structure-Preserving Signatures from Standard Assumptions, Revisited
... starting from structure-preserving signatures is that we can obtain efficient protocols that are secure under standard cryptographic assumptions without the use of random ...build ... See full document
26
Simulation-based Receiver Selective Opening CCA Secure PKE from Standard Computational Assumptions
... An efficient and concrete construction of RNC-CCA secure ...on standard computational assumptions, we require an NIZK proof system as a building ...very efficient, and thus the above ... See full document
36
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
... different from the inner product predicate functionality of [43, 3]: the former computes the actual value of the inner product while the latter tests whether the inner product is zero or not, and reveals a hidden ... See full document
41
Efficient Adaptively Secure IBBE from Standard Assumptions
... All the schemes mentioned so far are secure under some non-standard and parametrised assumptions. The first BE scheme secure proved secure under static assumptions was proposed by Waters [Wat09] ... See full document
29
Registration-Based Encryption from Standard Assumptions
... identities) from left to ...parameter compact, because the public parameter is basically the concatenation of the roots of theses trees, and so the number of trees shall remain ... See full document
30
Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions
... an efficient opener, then the resulting PKE scheme can be proven to be SIM-SO-CCA secure as shown in ...PKE from a special kind of key encapsulation mechanism (KEM) in combination with a strengthened XAC ... See full document
50
Variants of Waters' Dual-System Primitives Using Asymmetric Pairings
... more efficient dual-system IBE scheme using asymmetric pairings whose security is based on non-standard but static ...on standard assumptions and in comparison to Waters original scheme ... See full document
43
Review of Mathematical Models in Performance Calculation of Screw Compressors
... Arising from this work, he is the author and co- author of over 150 refereed publications and more than 100 major industrial reports, two textbooks in screw compressors, a textbook on computers in engineering ... See full document
20
MALERT: Modified Anonymous Location Based Efficient Routing Protocol Using Node Categorization Algorithm in MANETs G. Meenakshi *1 , Kiran. M 2, Praveen. L3
... Anew anonymous authentication protocol for mobile ad hoc networks enhanced with a distributed reputation system, which conceals a real identity of communicating nodes with an ability to resist known attacks [8] ... See full document
6
EXACT DEFINITION OF MATHEMATICS
... The aim of the article is to propound a simplest and exact definition of mathematics in a single sentence. It is observed that all mathematical and non-mathematical subjects whether science, arts, language or commerce, ... See full document
9
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF
... Constrained PRFs. Constrained PRFs (CPRFs) have been introduced simultaneously by Boneh and Waters [BW13], Kiayias et al. [KPTZ13] (as “Delegatable PRFs”) and by Boyle, Goldwasser and Ivan [BGI14] (as “Functional PRFs”). ... See full document
29
Related subjects