Results 11 to 20 of about 50 (49)
Context-Aware Access Control Model for Privacy Support in Mobile-Based Assisted Living
The average lifetime of people in advanced countries is significantly increased in the XXI century. The number of old and dependent people is rising due many innovations in health care: new technologies, medicine, and a lot of innovative devices that ...
Smirnov Alexander +3 more
doaj +1 more source
A survey and refinement of repairable threshold schemes
We consider repairable threshold schemes (RTSs), which are threshold schemes that enable a player to securely reconstruct a lost share with help from their peers.
Laing Thalia M., Stinson Douglas R.
doaj +1 more source
A characterisation of ideal weighted secret sharing schemes
Beimel, Tassa and Weinreb [SIAM J. Discrete Math. 22 (2008), 360–397] and Farràs and Padró [Lecture Notes in Comput. Sci. 5978, Springer, 2010, 219–236] partially characterised access structures of ideal weighted secret sharing schemes in terms of the ...
Hameed Ali, Slinko Arkadii
doaj +1 more source
On the security of joint signature and encryption revisited
In 2002, An et al. [1] proposed three generic conversions of signcryption, ℰt𝒮${\mathcal{E}t\mathcal{S}}$, 𝒮tℰ${\mathcal{S}t\mathcal{E}}$ and 𝒞tℰ&𝒮${\mathcal{C}t\mathcal{E}\&\mathcal{S}}$ from the primitive encryption scheme and signature scheme ...
Nandi Mridul, Pandit Tapas
doaj +1 more source
The complexity of the connected graph access structure on seven participants
In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of ...
Hadian Dehkordi Massoud, Safi Ali
doaj +1 more source
On the optimality of non-linear computations for symmetric key primitives
A block is an n-bit string, and a (possibly keyed) block-function is a non-linear mapping that maps one block to another, e.g., a block-cipher. In this paper, we consider various symmetric key primitives with ℓ{\ell} block inputs and raise the following ...
Chakraborti Avik +2 more
doaj +1 more source
Predicate signatures from pair encodings via dual system proof technique
Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings.
Nandi Mridul, Pandit Tapas
doaj +1 more source
Cryptographic identification protocols enable a prover to prove its identity to a verifier. A subclass of such protocols are shared-secret challenge-response identification protocols in which the prover and the verifier share the same secret and the ...
Asghar Hassan Jameel, Kaafar Mohamed Ali
doaj +1 more source
A secure anonymous proxy signcryption scheme
We introduce a new cryptographic primitive identity-based anonymous proxy signcryption which provides anonymity to the proxy sender while also providing a mechanism to the original sender to expose the identity of the proxy sender in case of misuse.
Saraswat Vishal +2 more
doaj +1 more source
Searchable encryption with randomized ciphertext and randomized keyword search
The notion of public-key encryption with keyword search (PEKS) was introduced to search over encrypted data without performing any decryption. In this article, we propose a PEKS scheme in which both the encrypted keyword and the trapdoor are randomized ...
Calderini Marco +3 more
doaj +1 more source

