Defines what is the goal of this operation.

Values that the anonymization process will keep and possibly modify with the specified rules.

A FHIRPath string that points the value being kept and might be modified.

A new value that will be taken by all of the elements. Should be used alone.

A noise that will be applied randomly on all elements.

All elements will be shuffled, none of the resources will keep their original value, but will get one from another resource.

Encryption algorithm supported, depending from the anonymizer.

Hashing algorithm supported, depending from the anonymizer.

Every value will get unique value unrelated from his original value.

If the value is a int (k), ll the value will be in a group with at least k value. If the value is a ConceptMap, all values will get their target value.

In addition with the k-anonymization (aggregation) of another element, the l-diversity indicate how much of

If t-closeness is set, each group from k-anonymization will get the same distribution as the whole dataset.

Base definition for all types defined in FHIR type system.

Defines what is the goal of this operation.

Values that the anonymization process will keep and possibly modify with the specified rules.

May be used to represent additional information that is not part of the basic definition of the element and that modifies the understanding of the element in which it is contained and/or the understanding of the containing element's descendants. Usually modifier elements provide negation or qualification. To make the use of extensions safe and managable, there is a strict set of governance applied to the definition and use of extensions. Though any implementer can define an extension, there is a set of requirements that SHALL be met as part of the definition of the extension. Applications processing a resource are required to check for modifier extensions.

Modifier extensions SHALL NOT change the meaning of any elements on Resource or DomainResource (including cannot change the meaning of modifierExtension itself).

There can be no stigma associated with the use of extensions by any application, project, or standard - regardless of the institution or jurisdiction that uses or defines the extensions. The use of extensions is what allows the FHIR specification to retain a core level of simplicity for everyone.

Modifier extensions allow for extensions that cannot be safely ignored to be clearly distinguished from the vast majority of extensions which can be safely ignored. This promotes interoperability by eliminating the need for implementers to prohibit the presence of extensions. For further information, see the definition of modifier extensions.

A FHIRPath string that points the value being kept and might be modified.

A new value that will be taken by all of the elements. Should be used alone.

A noise that will be applied randomly on all elements.

All elements will be shuffled, none of the resources will keep their original value, but will get one from another resource.

Encryption algorithm supported, depending from the anonymizer.

Hashing algorithm supported, depending from the anonymizer.

Every value will get unique value unrelated from his original value.

If the value is a int (k), ll the value will be in a group with at least k value. If the value is a ConceptMap, all values will get their target value.

In addition with the k-anonymization (aggregation) of another element, the l-diversity indicate how much of

If t-closeness is set, each group from k-anonymization will get the same distribution as the whole dataset.

Base definition for all types defined in FHIR type system.

Defines what is the goal of this operation.

Values that the anonymization process will keep and possibly modify with the specified rules.

Unique id for the element within a resource (for internal references). This may be any string value that does not contain spaces.

May be used to represent additional information that is not part of the basic definition of the element. To make the use of extensions safe and managable, there is a strict set of governance applied to the definition and use of extensions. Though any implementer can define an extension, there is a set of requirements that SHALL be met as part of the definition of the extension.

There can be no stigma associated with the use of extensions by any application, project, or standard - regardless of the institution or jurisdiction that uses or defines the extensions. The use of extensions is what allows the FHIR specification to retain a core level of simplicity for everyone.

May be used to represent additional information that is not part of the basic definition of the element and that modifies the understanding of the element in which it is contained and/or the understanding of the containing element's descendants. Usually modifier elements provide negation or qualification. To make the use of extensions safe and managable, there is a strict set of governance applied to the definition and use of extensions. Though any implementer can define an extension, there is a set of requirements that SHALL be met as part of the definition of the extension. Applications processing a resource are required to check for modifier extensions.

Modifier extensions SHALL NOT change the meaning of any elements on Resource or DomainResource (including cannot change the meaning of modifierExtension itself).

There can be no stigma associated with the use of extensions by any application, project, or standard - regardless of the institution or jurisdiction that uses or defines the extensions. The use of extensions is what allows the FHIR specification to retain a core level of simplicity for everyone.

Modifier extensions allow for extensions that cannot be safely ignored to be clearly distinguished from the vast majority of extensions which can be safely ignored. This promotes interoperability by eliminating the need for implementers to prohibit the presence of extensions. For further information, see the definition of modifier extensions.

A FHIRPath string that points the value being kept and might be modified.

A new value that will be taken by all of the elements. Should be used alone.

A noise that will be applied randomly on all elements.

All elements will be shuffled, none of the resources will keep their original value, but will get one from another resource.

Encryption algorithm supported, depending from the anonymizer.

Hashing algorithm supported, depending from the anonymizer.

Every value will get unique value unrelated from his original value.

If the value is a int (k), ll the value will be in a group with at least k value. If the value is a ConceptMap, all values will get their target value.

In addition with the k-anonymization (aggregation) of another element, the l-diversity indicate how much of

If t-closeness is set, each group from k-anonymization will get the same distribution as the whole dataset.