Relevant bibliographies by topics / Deletion verification

Contents

  1. Journal articles
  2. Book chapters
  3. Conference papers

Academic literature on the topic 'Deletion verification'

Author: Grafiati
Published: 5 June 2025
Last updated: 24 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Deletion verification.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Deletion verification"

1

Qambar, Aziz Kawa, and Baban Ahmed Mahmood. "Assured data deletion in cloud computing: security analysis and requirements." Indonesian Journal of Electrical Engineering and Computer Science 28, no. 2 (2022): 1174–83. https://doi.org/10.11591/ijeecs.v28.i2.pp1174-1183.

Full text
Abstract:
With the rapid development of cloud storage, more data owners store their data on the remote cloud to reduce the heavy local storage overhead. Cloud storage provides clients with a storage space that they may outsource and use on a pay-as-you-go basis. Due to data ownership separation and management, local data owners lose control over their data. Hence, all the operations over the outsourced data such as data transfer, update, and deletion, will be executed by the remote cloud server. As a result of that, various security challenges appear in terms of data privacy and integrity. In addition to data deletion that becomes an important security challenge, once a cloud user intends to delete his data, it must be sure that data is deleted from all cloud storage sources and prevent the cloud server from reserving the data maliciously for economic interests. In this paper, we present and discuss several types of research that use different technologies to solve assured deletion problems and verification the deletion result. The paper also presents a thorough analysis of the surveyed protocols in terms of finegrained, security, performance, and requirements of remote cloud storage design.
APA, Harvard, Vancouver, ISO, and other styles
2

Sommer, David M., Liwei Song, Sameer Wagh, and Prateek Mittal. "Athena: Probabilistic Verification of Machine Unlearning." Proceedings on Privacy Enhancing Technologies 2022, no. 3 (2022): 268–90. http://dx.doi.org/10.56553/popets-2022-0072.

Full text
Abstract:
The right to be forgotten, also known as the right to erasure, is the right of individuals to have their data erased from an entity storing it. The status of this long held notion was legally solidified recently by the General Data Protection Regulation (GDPR) in the European Union. As a consequence, there is a need for mechanisms whereby users can verify if service providers comply with their deletion requests. In this work, we take the first step in proposing a formal framework, called Athena, to study the design of such verification mechanisms for data deletion requests – also known as machine unlearning – in the context of systems that provide machine learning as a service (MLaaS). Athena allows the rigorous quantification of any verification mechanism based on hypothesis testing. Furthermore, we propose a novel verification mechanism that leverages backdoors and demonstrate its effectiveness in certifying data deletion with high confidence, thus providing a basis for quantitatively inferring machine unlearning. We evaluate our approach over a range of network architectures such as multi-layer perceptrons (MLP), convolutional neural networks (CNN), residual networks (ResNet), and long short-term memory (LSTM) and over 6 different datasets. We demonstrate that: (1) our approach has minimal effect on the accuracy of the ML service but provides high confidence verification of unlearning, even if multiple users employ our system to ascertain compliance with data deletion requests, and (2) our mechanism is robust against servers deploying state-of-the-art backdoor defense methods. Overall, our approach provides a foundation for a quantitative analysis of verifying machine unlearning, which can provide support for legal and regulatory frameworks pertaining to users’ data deletion requests.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Lihua, Chunhui Liu, Boping Li, Haodong Fang, and Jinguang Gu. "A Secure Storage and Deletion Verification Scheme of Microgrid Data Based on Integrating Blockchain into Edge Computing." Electronics 11, no. 23 (2022): 4033. http://dx.doi.org/10.3390/electronics11234033.

Full text
Abstract:
A microgrid generates a large amount of power data during daily operation, which needs to be safely transferred, stored, and deleted. In this paper, we propose a secure storage and deletion verification scheme that combines blockchain and edge computing for the problems of limited storage capacity of blockchain and unverifiable data deletion. Firstly, edge computing is used to preprocess power data to reduce the amount of data and to improve the quality of data. Secondly, a hybrid encryption method that combines the improved ElGamal algorithm and the AES-256 algorithm is used to encrypt outsourcing data, and a secure storage chain is built based on the K-Raft consensus protocol to ensure the security of data in the transmission process. Finally, after initiating a data deletion request and successfully deleting the data, a deletion proof is generated and stored in the chain built, based on the Streamlet consensus protocol. The experimental results illustrate that the basic computing cost, block generation time, and communication delay of this scheme are the most efficient; the efficiency of the improved ElGamal algorithm is three times that of the traditional algorithm; the transaction throughput of the the double-layer blockchain can reach 13,000 tps at most. This scheme can realize the safe storage of microgrid data, and can also realize the efficient deletion and verification of outsourcing data.
APA, Harvard, Vancouver, ISO, and other styles
4

Ma, Jun, Minshen Wang, Jinbo Xiong, and Yongjin Hu. "CP-ABE-Based Secure and Verifiable Data Deletion in Cloud." Security and Communication Networks 2021 (March 27, 2021): 1–14. http://dx.doi.org/10.1155/2021/8855341.

Full text
Abstract:
Cloud data, the ownership of which is separated from their administration, usually contain users’ private information, especially in the fifth-generation mobile communication (5G) environment, because of collecting data from various smart mobile devices inevitably containing personal information. If it is not securely deleted in time or the result of data deletion cannot be verified after their expiration, this will lead to serious issues, such as unauthorized access and data privacy disclosure. Therefore, this affects the security of cloud data and hinders the development of cloud computing services seriously. In this paper, we propose a novel secure data deletion and verification (SDVC) scheme based on CP-ABE to achieve fine-grained secure data deletion and deletion verification for cloud data. Based on the idea of access policy in CP-ABE, we construct an attribute association tree to implement fast revoking attribute and reencrypting key to achieve fine-grained control of secure key deletion. Furthermore, we build a rule transposition algorithm to generate random data blocks and combine the overwriting technology with the Merkle hash tree to implement secure ciphertext deletion and generate a validator, which is then used to verify the result of data deletion. We prove the security of the SDVC scheme under the standard model and verify the correctness and effectiveness of the SDVC scheme through theoretical analysis and ample simulation experiment results.
APA, Harvard, Vancouver, ISO, and other styles
5

Tang, YongLi, Shuai Wu, and XiaoJun Wang. "Redactable Blockchain Trust Scheme Based on Reputation Consensus for MEC." Computational Intelligence and Neuroscience 2022 (April 28, 2022): 1–14. http://dx.doi.org/10.1155/2022/3269445.

Full text
Abstract:
Blockchain technology can build trust, reduce costs, and accelerate transactions in the mobile edge computing (MEC) and manage computing resources using the smart contract. However, the immutability of blockchain also poses challenges for the MEC, such as the smart contract with bugs cannot be modified or deleted. We propose a redactable blockchain trust scheme based on reputation consensus and a one-way trapdoor function in response to the problem that data on the blockchain, which is an error or invalid needs to be modified or deleted. The scheme calculates each user’s reputation based on their currency age and behavior. The SM2 asymmetric cryptography algorithm is used as the one-way trapdoor function to construct a new Merkle tree structure, which guarantees the legitimacy of the modification or deletion after verification and vote. The simulation experiments show that the modification or deletion does not change the existing blockchain structure and the links of blocks. Furthermore, the consensus verification accurately passes after the modification or deletion operations, which indicates the proposed scheme is feasible.
APA, Harvard, Vancouver, ISO, and other styles
6

Klausegger, Alfred, Fabian Leditzky, Susanne Krämer, et al. "A Novel Homozygous 9385 bp Deletion in the FERMT1 (KIND1) Gene in a Malaysian Family with Kindler Epidermolysis bullosa and a Review of Large Deletions." International Journal of Molecular Sciences 26, no. 9 (2025): 4237. https://doi.org/10.3390/ijms26094237.

Full text
Abstract:
Kindler Epidermolysis bullosa (KEB; OMIM 173650) is a rare autosomal recessive genodermatosis characterized by bullous poikiloderma and photosensitivity. Additional presentations include blistering, poor wound healing, skin atrophy, and increased risk of skin cancer. Most cases of KEB result from aberrations in the FERMT1 (Fermitin family member 1) gene encoding kindlin-1 and include nonsense, frameshift, splicing, and missense variants. Large deletion variants have been reported in nine cases to date. Most variants are predicted to lead to premature termination of translation and to loss of kindlin-1 function. In this study, we report on a 33-year-old male patient who presented with typical clinical manifestations of KEB. As routine molecular testing failed to obtain a diagnosis, Next Generation Sequencing (NGS) of an Epidermolysis Bullosa (EB)-specific panel was carried out followed by the determination of the deletion breakpoints and verification at the mRNA and protein levels. This approach revealed a new large homozygous deletion of ~9.4 kb in the FERMT1 gene involving exons 7 to 9. Finally, we performed a literature review on large FERMT1 deletions. The deletion is predicted to skip exons 7 to 9 within the mRNA, which results in a frameshift. The patient’s phenotype is likely caused by the resulting truncated and non-functioning protein. Our report further enriches the spectrum of FERMT1 gene variants to improve genotype–phenotype correlations.
APA, Harvard, Vancouver, ISO, and other styles
7

Liehr, Thomas, Sylke Singer, Ulrike Mau-Holzmann, et al. "Results of Chromosomal Microarray Need to Always Be Checked by (Molecular) Cytogenetics—Even If They Seem to Be Simple Deletions." Genes 16, no. 6 (2025): 714. https://doi.org/10.3390/genes16060714.

Full text
Abstract:
Background/Objectives: Chromosome microarrays (CMAs) tend to be used as the first line test or as a test that does not require confirmation or verification by a second test. However, to understand the implications of a duplication or deletion for a family seeking genetic counseling, it is crucial to know the nature of the underlying chromosomal rearrangement. Here, we present seven cases with apparent isolated copy number loss, five of which showed unexpected complexity. Methods: Seven cases were investigated by CMA due to intellectual disability and/or dysmorphic features. Isolated deletions ranging in size from ~0.6 to ~21 Mb were found and referred for further characterization of the underlying chromosomal rearrangement. To elucidate the cases, fluorescence in situ hybridization was performed using locus-specific, whole and partial chromosome painting and/or multicolor banding. Results: Among the seven selected cases, there were five with unexpected complexity. Isolated deletions were actually evidence of chromoanasynthesis, ring chromosome formation, unbalanced translocation, or unbalanced insertion. Conclusions: These results clearly underscore that it seems reasonable to examine every case with a copy number variant—even if it appears to be “only” a simple partial deletion—using banding and/or molecular cytogenetic testing in order to make a qualified assessment of the situation and, on this basis, ensure sound genetic counseling.
APA, Harvard, Vancouver, ISO, and other styles
8

Zhuang, Jianlong, Yu Zheng, Yuying Jiang, Junyu Wang, Shuhong Zeng та Nansong Liu. "Long-Read Sequencing Identified a Large Novel δ/β-Globin Gene Deletion in a Chinese Family". Human Mutation 2023 (4 жовтня 2023): 1–8. http://dx.doi.org/10.1155/2023/2766625.

Full text
Abstract:
Objective. Increasingly rare thalassemia has been identified with the advanced use of long-read sequencing based on long-read technology. Here, we aim to present a novel δ/β-globin gene deletion identified by long-read sequencing technology. Methods. Enrolled in this study was a family from the Quanzhou region of Southeast China. Routine blood analysis and hemoglobin (Hb) capillary electrophoresis were used for hematological screening. Genetic testing for common α- and β-thalassemia was carried out using the reverse dot blot hybridization technique. Long-read sequencing was performed to detect rare globin gene variants. Specific gap-polymerase chain reaction (gap-PCR) and/or Sanger sequencing were further used to verify the detected variants. Results. None of the common α- and β-thalassemia mutations or deletions were observed in the family. However, decreased levels of MCV, MCH, and abnormal Hb bands were observed in the family members, who were suspected as rare thalassemia carriers. Further, long-read sequencing demonstrated a large novel 7.414 kb deletion NG_000007.3:g.63511_70924del partially cover HBB and HBD globin genes causing delta-beta fusion gene in the proband. Parental verification indicated that the deletion was inherited from the proband’s father, while none of the globin gene variants were observed in the proband’s mother. In addition, the novel δ/β-globin gene deletion was further verified by gap-PCR and Sanger sequencing. Conclusion. In this study, we first present a large novel δ/β-globin gene deletion in a Chinese family using long-read sequencing, which may cause δβ-thalassemia. This study further enhances that long-read sequencing would be applied as a sharp tool for detecting rare and novel globin gene variants.
APA, Harvard, Vancouver, ISO, and other styles
9

Cardelli, E., E. Della Torre, and A. Faba. "Experimental Verification of the Deletion and Congruency Properties in Si-Fe Magnetic Steels." IEEE Transactions on Magnetics 45, no. 11 (2009): 5243–46. http://dx.doi.org/10.1109/tmag.2009.2031077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tulkinbekov, Khikmatullo, and Deok-Hwan Kim. "Data Modifications in Blockchain Architecture for Big-Data Processing." Sensors 23, no. 21 (2023): 8762. http://dx.doi.org/10.3390/s23218762.

Full text
Abstract:
Due to the immutability of blockchain, the integration with big-data systems creates limitations on redundancy, scalability, cost, and latency. Additionally, large amounts of invaluable data result in the waste of energy and storage resources. As a result, the demand for data deletion possibilities in blockchain has risen over the last decade. Although several prior studies have introduced methods to address data modification features in blockchain, most of the proposed systems need shorter deletion delays and security requirements. This study proposes a novel blockchain architecture called Unlichain that provides data-modification features within public blockchain architecture. To achieve this goal, Unlichain employed a new indexing technique that defines the deletion time for predefined lifetime data. The indexing technique also enables the deletion possibility for unknown lifetime data. Unlichain employs a new metadata verification consensus among full and meta nodes to avoid delays and extra storage usage. Moreover, Unlichain motivates network nodes to include more transactions in a new block, which motivates nodes to scan for expired data during block mining. The evaluations proved that Unlichain architecture successfully enables instant data deletion while the existing solutions suffer from block dependency issues. Additionally, storage usage is reduced by up to 10%.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Deletion verification"

1

Cauli, Claudia, Magdalena Ortiz, and Nir Piterman. "Actions over Core-Closed Knowledge Bases." In Automated Reasoning. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_17.

Full text
Abstract:
AbstractWe present new results on the application of semantic- and knowledge-based reasoning techniques to the analysis of cloud deployments. In particular, to the security of Infrastructure as Code configuration files, encoded as description logic knowledge bases. We introduce an action language to model mutating actions; that is, actions that change the structural configuration of a given deployment by adding, modifying, or deleting resources. We mainly focus on two problems: the problem of determining whether the execution of an action, no matter the parameters passed to it, will not cause the violation of some security requirement (static verification), and the problem of finding sequences of actions that would lead the deployment to a state where (un)desirable properties are (not) satisfied (plan existence and plan synthesis). For all these problems, we provide definitions, complexity results, and decision procedures.
APA, Harvard, Vancouver, ISO, and other styles
2

Lawrence, Linju, and R. Shreelekshmi. "Chained Digital Signature for the Improved Video Integrity Verification." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2021. http://dx.doi.org/10.3233/faia210284.

Full text
Abstract:
The recorded videos from the surveillance cameras can be used as potential evidence in forensic applications. These videos can be easily manipulated or tampered with video editing tools without leaving visible clues. Hence integrity verification is essential before using the videos as evidence. Existing methods mostly depend on the analysis of video data stream and video container for tampering detection. This paper discusses an active video integrity verification method using Elliptic Curve Cryptography and blockchain. The method uses Elliptic Curve Digital Signature Algorithm for calculating digital signature for video content and previous block. The digital signature of the encoded video segment (video content with predetermined size) and that of previous block are kept in each block to form an unbreakable chain. Our method does not consider any coding or compression artifacts of the video file and can be used on any video type and is tested on public-available standard videos with varying sizes and types. The proposed integrity verification scheme has better detection capabilities towards different types of alterations like insertion, copy-paste and deletion and can detect any type of forgery. This method is faster and more resistant to brute force and collision attacks in comparison to existing recent blockchain method.
APA, Harvard, Vancouver, ISO, and other styles
3

Al-Jumaily, Harith T., Dolores Cuadra, and Paloma Martínez. "MDD Approach for Maintaining Integrity Constraints in Databases." In Handbook of Research on Innovations in Database Technologies and Applications. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-242-8.ch017.

Full text
Abstract:
In the context of database, we believe that MDD (Model-Driven Development) (OMG, 2006) is a very ambitious task because we find that when applying database development methodologies such as (Elmasri, et al., 2007), there are processes devoted to transforming conceptual into logical schemata. In such processes, semantic losses are produced since logical elements are not coincident with conceptual elements. A correct constraints transformation is necessary to preserve the semantics that reflects the Universe of Discourse. The multiplicity constraint, also called cardinality constraint, is one of these constraints that can be established in a conceptual schema. It has dynamic aspects that are transformed into the logical model as certain conditions to verify the insertion, deletion, and update operations. The verification of these constraints is a serious and complex problem because currently database systems are not able to preserve the multiplicity constraints of their objects. To solve the modeling problem, CASE tools have been introduced to automate the life cycle of database development. These platforms try to help the database developers in different design phases. Nevertheless, these tools are frequently simple graphical interfaces and do not completely carryout the design methodology that they are should to support.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Deletion verification"

1

Xu, Duo. "How to Certify Deletion with Constant-Length Verification Key." In 2024 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2024. https://doi.org/10.23919/isita60732.2024.10858222.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sunkireddy, Sravanthi, and Ayad Barsoum. "Remote Data Integrity for Cloud Based Storage System." In SSPC 2016 Greencoat. SSPC, 2016. https://doi.org/10.5006/s2016-00068.

Full text
Abstract:
Abstract Cloud computing provides a reliable and robust infrastructure for users to remotely store and access huge amount of data. However, data integrity in the cloud is a major security concern for data owners no longer physically possess their sensitive data. To mitigate this challenge, remote data integrity has been proposed as a mechanism to enable data owners to verify the correctness of their outsourced data. The remote verification process needs to be done with reduced communication, computation and storage overhead. That is why traditional cryptographic primitives for data integrity based on hashing and signature schemes are not applicable; for it is impractical to download all stored data to validate their integrity (expensive I/O operations and immense communication overheads). Therefore, provable data possession (PDP) has been the main focus for many research studies to efficiently, periodically, and securely validate that a remote server – which supposedly stores the owner's potentially very large amount of data – is actually storing the data intact. There are many different variations of PDP schemes under different cryptographic assumptions. In this study, we provide a comparative analysis of various PDP schemes. We investigate not only PDP schemes for static data, but also protocols that handle the dynamic behavior of outsourced data. We implement a prototype that allows the data owner to outsource their data, and dynamically update the data by inserting, deleting, or modifying some data blocks. The prototype also evaluates the performance of different PDP schemes from different perspectives such as pre-computation times, computation times, verification times and storage overhead.
APA, Harvard, Vancouver, ISO, and other styles
3

Delamaro, Marcio Eduardo, Jeff Offutt, and Paul Ammann. "Designing Deletion Mutation Operators." In 2014 IEEE Seventh International Conference on Software Testing, Verification and Validation (ICST). IEEE, 2014. http://dx.doi.org/10.1109/icst.2014.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Durelli, Vinicius H. S., Nilton M. De Souza, and Marcio E. Delamaro. "Are Deletion Mutants Easier to Identify Manually?" In 2017 IEEE International Conference on Software Testing, Verification and Validation: Workshops (ICSTW). IEEE, 2017. http://dx.doi.org/10.1109/icstw.2017.32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Deng, Lin, Jeff Offutt, and Nan Li. "Empirical Evaluation of the Statement Deletion Mutation Operator." In 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation (ICST). IEEE, 2013. http://dx.doi.org/10.1109/icst.2013.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Barták, Roman, Simona Ondrčková, Gregor Behnke, and Pascal Bercher. "Correcting Hierarchical Plans by Action Deletion." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/10.

Full text
Abstract:
Hierarchical task network (HTN) planning is a model-based approach to planning. The HTN domain model consists of tasks and methods to decompose them into subtasks until obtaining primitive tasks (actions). There are recent methods for verifying if a given action sequence is a valid HTN plan. However, if the plan is invalid, all existing verification methods only say so without explaining why the plan is invalid. In the paper, we propose a method that corrects a given action sequence to form a valid HTN plan by deleting the minimal number of actions. This plan correction explains what is wrong with a given action sequence concerning the HTN domain model.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, K. F., and Hoda H. ElMaraghy. "Validity Check for a Function-Oriented Modeler." In ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0402.

Full text
Abstract:
Abstract This paper presents a method for validity check for a feature-oriented modeler which is developed at the center for flexible manufacturing at McMaster University. Maintaining feature validity after feature deletion or modification is, an important issue in product modelling. Among the current commercial modelling systems, it is the designers’ responsibility to create a valid product model. The graphical display of the model provides an auxiliary means for feature verification. However such visual checking is incomplete, unreliable and time-consuming. In the case of invalid internal features, such as, holes and pockets, the visual check usually fails. The approach proposed by authors intends to maintain a valid model by the system automatically. Any interference between features which occurs after an addition, deletion or edition operation will be detected by the system and is resolved by either built-in rules or user’s assistance.
APA, Harvard, Vancouver, ISO, and other styles
8

Bright, Curtis, Kevin K. H. Cheung, Brett Stevens, Ilias Kotsireas, and Vijay Ganesh. "Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/203.

Full text
Abstract:
In the 1970s and 1980s, searches performed by L. Carter, C. Lam, L. Thiel, and S. Swiercz showed that projective planes of order ten with weight 16 codewords do not exist. These searches required highly specialized and optimized computer programs and required about 2,000 hours of computing time on mainframe and supermini computers. In 2010, these searches were verified by D. Roy using an optimized C program and 16,000 hours on a cluster of desktop machines. We performed a verification of these searches by reducing the problem to the Boolean satisfiability problem (SAT). Our verification uses the cube-and-conquer SAT solving paradigm, symmetry breaking techniques using the computer algebra system Maple, and a result of Carter that there are ten nonisomorphic cases to check. Our searches completed in about 30 hours on a desktop machine and produced nonexistence proofs of about 1 terabyte in the DRAT (deletion resolution asymmetric tautology) format.
APA, Harvard, Vancouver, ISO, and other styles
9

Mitzenmachert, M. "Verification codes for deletions." In IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/isit.2003.1228231.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Deletion verification' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography