In this paper we propose a new framework for multicast security based on distributed computation of security transforms by intermediate nodes. The involvement of intermediate nodes in the security process causes a new type of dependency between group membership and the topology of the multicast network. Thanks to this dependency, the containment of security exposures in large multicast groups is assured. The framework also assures both the scalability for large dynamic groups and the security of individual members. Two different key distribution protocols complying with the framework are introduced. The first protocol is an extension of the El Gamal encryption scheme whereas the second is based on a multi-exponent version of RSA.

Scalable multicast security in dynamic groups

In this paper, we motivate the need for efficient multisignature schemes in delegated mobile services. With the schemes, delegates can be identified and delegated accesses can be controlled. First, we give a new digital signature scheme with message recovery. Based on the digital signature scheme, two digital multisignature schemes are proposed: the parallel multisignature scheme and the serial multisignature scheme. The parallel multisignature scheme allows each user to sign the same message separately and independently, and then combines all individual signatures into a multisignature. The serial multisignature scheme allows a group of users to sign the message serially, and does not need to predetermine the signing order. Both multisignature schemes can withstand the attacks that aim to forge the signatures or to get the private keys of the signers.

https://ir.nctu.edu.tw:443/bitstream/11536/30402/1/000089895800040.pdf

Digital multisignature schemes for authenticating delegates in mobile code systems

Conditional access system (CAS) is the essential basis of a digital pay-TV system, which is used to prevent unauthorized access to audio/video data and ensure the benefit of the service providers. In the CAS, key distribution is an essential part, whether the distribution scheme succeeding or not can directly affect the security of the CAS. In this paper, based on four-level key hierarchy, a new key distribution scheme based on grouping access control for conditional access system in digital pay-TV system is presented, in which we adopt the new scheme to generate and distribute authorization key and group key more efficiently. Our key distribution scheme can greatly reduce computation overhead and the complexity while providing higher security. Moreover, the proposed scheme is scalable in processing joining and leaving of subscribers, which makes service provider easy to manage the subscribers dynamically. In the end, we analyze the security and performance of the proposed scheme and compare it with other schemes. It shows that our proposed scheme is efficient and suitable for a digital pay-TV system which can provide both PPC and PPV services and is feasible for practical application.

A scalable key distribution scheme for conditional access system in digital pay-TV system

Compact multisignature is vital for shrinking the signature size of decentralized blockchain. All practical compact multisignature schemes have been constructed from the discrete logarithm problem which is potentially vulnerable to quantum computing attacks. Lattice-based multisignature schemes are potential candidates for resisting quantum attacks. However, the existing lattice-based multisignature schemes suffer either loose signatures or large public key and signature sizes after compressing, which makes them unsuitable for blockchains. In this paper, we first present a practical lattice-based multisignature scheme with much smaller signature sizes than previous lattice-based multisignature schemes. Then, we extend our scheme to support public key aggregation with almost the same performance. Both of our multisignature schemes are provably secure in the random oracle model under the ring version of the short integer solution (Ring-SIS) assumption. They outperform the recent lattice-based multisignature scheme proposed by Bansarkhani and Sturm (BS) in terms of both signature size and communication overhead.

Practical Lattice-Based Multisignature Schemes for Blockchains

Efficient identity-based RSA multisignatures

Implementations of the RSA scheme have inherent difficulties related to bit expansion, with consequent difficulties for blocking and multisignatures. Solutions to these latter two problems, which flow naturally from a solution to the root problem of bit expansion are presented.

RSA blocking and multisignature schemes with no bit expansion

The authors propose a decentralized key distribution scheme. In this scheme, there are as many local key centers as needed and each user needs to select a key center at which to register when first joining the network. The most significant feature of the method is that each center needs only a single secret key. All personal keys that it needs for delivering encrypted keys to groups of users can be derived from this single key through a one-way function. >

Authenticated group key distribution scheme for a large distributed network

S. Akl and P. Taylor (Proc. Crypto-82, p.237-250, 1982) proposed an elegant solution to the multilevel key distribution problem, using a cryptographic approach. In the present work, two problems associated with the Akl-Taylor scheme are considered. First, a time-memory tradeoff technique to overcome the problem of the extremely large memory space required by the Akl-Taylor scheme is proposed. Second, an extended scheme that localizes within a small region as much as possible the inserting/deleting problem associated with the Akl-Taylor scheme is proposed. >

An extended cryptographic key generation scheme for multilevel data security

The letter proposes a modified public-key cryptosystem based on the Rabin scheme. It can provide simultaneously both private encryption and digital signatures for network users. In the cases where it provides only encryption or only digital signatures, the scheme provides that the bit ratio between plaintext and ciphertext is 1:1 , i.e. equivalent to that of the RSA scheme.

Improved Rabin's scheme with high efficiency

Owing to their mathematical properties, quadratic residues have been used successfully in designing a number of cryptographic applications, such as oblivious transfer protocol and coin flipping protocol. The authors propose an encryption scheme based on quadratic residue theory. In particular, they incorporate the encrypting procedure and error-detecting code into a complete communication system.

Public-key encryption algorithm incorporating error detection

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

T. Kiesler

Author Tools

Chat about Author