Mechanism for optimal error-privacy trade-off in information processing systems

Abstract

Example embodiments of the present disclosure are directed to an optimal error- privacy trade-off in information processing system. A method comprises obtaining transmission property information of a link between the first apparatus and a second apparatus based on a measurement metric on the link; and obtaining a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.

Description

NC333554 MECHANISM FOR OPTIMAL ERROR-PRIVACY TRADE-OFF IN INFORMATION PROCESSING SYSTEMS FIELD

[0001] Various example embodiments of the present disclosure generally relate to thefield of telecommunication and in particular, to methods, devices, apparatuses and computer readable storage medium for optimal error-privacy trade-off in information processing systems. BACKGROUND

[0002] A communication network may serve as a facility that enables communicationsbetween two or more communication devices or provides communication devices access to a data network. A mobile or wireless communication network is one example of a communication network. A communication device may be provided with a service by an application server.

[0003] The communication network may operate in accordance with standards such asthose provided by Third Generation Partnership Project (3GPP) or European Telecommunications Standards Institute (ETSI). Examples of standards provided by 3GPP are the so-called 3GPP standards for cellular technology generations, such as 3GPP standards for 4G technology, 5G technology, 6G technology etc. SUMMARY

[0004] Some example embodiments of this disclosure will be described with respect tocertain aspects. These aspects are not intended to indicate key or essential features of the various example embodiments of this disclosure. Nor are they intended to be used to limit the scope thereof. Other related features, aspects, and elements will be apparent to a person skilled in the art in view of this disclosure. For example, it should be appreciated that further aspects may be provided by the combination of any two or more of the various aspects described below.

[0005] In a first aspect of the present disclosure, there is provided a first apparatus. Thefirst apparatus comprises at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the first apparatus to: obtain transmission property information of a link between the first apparatus and a secondNC333554 apparatus based on a measurement metric on the link; and obtain a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.

[0006] According to some aspects, the first apparatus is caused to: skip applying thechannel coding to the data set based on the result.

[0007] According to some aspects, the result indicates not to apply the channel codingbased on a determination that a target symbol error probability obtained based on themeasurement metric and the transmission property information matching a referencesymbol error probability.

[0008] According to some aspects, the first apparatus is caused to: applying the channelcoding to the data set based on the result.

[0009] According to some aspects, the result indicates applying the channel coding basedon a determination that a target symbol error probability obtained based on themeasurement metric and the transmission property information matching a referencesymbol error probability.

[0010] According to some aspects, the first apparatus is caused to: based on adetermination that the channel coding is not applied to the data set, transmit, to the secondapparatus, a first indication indicating that no channel coding is applied to the data set.

[0011] According to some aspects, the first apparatus is caused to: receive, from thesecond apparatus, a second indication for a counting query over data at the first apparatus.

[0012] According to some aspects, the first apparatus is caused to: determine the data setby performing the counting query on the data.

[0013] According to some aspects, the first apparatus is caused to: transmit, to thesecond apparatus, a third indication indicating a usage of a type of private data transfer.

[0014] According to some aspects, the first apparatus is caused to: receive, from thesecond apparatus, one or more reference signals on the link; perform a measurement onthe one or more reference signals; and obtain the measurement metric by determining aSignal to Interference plus Noise Ratio (SINR) on the link based on the measurement.NC333554

[0015] According to some aspects, the first apparatus is caused to: obtain a symbol errorprobability for transmitting the data set based on a privacy parameter required by the dataset and the number of outputs of the counting query.

[0016] According to some aspects, the first apparatus is caused to: minimize the symbolerror probability for transmitting the data set by adjusting the measurement metric.

[0017] According to some aspects, the first apparatus is caused to: minimize the symbolerror probability for transmitting the data set by applying the channel coding to the dataset.

[0018] According to some aspects, the transmission property information is a probabilitytransition matrix related to the link.

[0019] In a second aspect of the present disclosure, there is provided a second apparatus.The second apparatus comprises at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the second apparatus to: receive, from a first apparatus, a first indication indicating that no channel coding is applied to a data set; receive the data set from the first apparatus; and decode the data set based on the first indication.

[0020] According to some aspects, the second apparatus is caused to: skip channeldecoding on the data set based on the first indication.

[0021] According to some aspects, the second apparatus is caused to: transmit, to thefirst apparatus, a second indication for a counting query over data at the first apparatus.

[0022] According to some aspects, the first second is caused to: receive, from the firstapparatus, a third indication indicating a usage of a type of private data transfer.

[0023] In a third aspect of the present disclosure, there is provided a method. Themethod comprises: obtaining transmission property information of a link between the first apparatus and a second apparatus based on a measurement metric on the link; and obtaining a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.

[0024] According to some aspects, the method further includes skipping applying thechannel coding to the data set based on the result.NC333554

[0025] According to some aspects, the result indicates not to apply the channel codingbased on a determination that a target symbol error probability obtained based on themeasurement metric and the transmission property information matching a referencesymbol error probability.

[0026] According to some aspects, the method further includes applying the channelcoding to the data set based on the result.

[0027] According to some aspects, the result indicates applying the channel coding basedon a determination that a target symbol error probability obtained based on themeasurement metric and the transmission property information matching a referencesymbol error probability.

[0028] According to some aspects, the method further includes based on a determinationthat the channel coding is not applied to the data set, transmitting, to the second apparatus,a first indication indicating that no channel coding is applied to the data set.

[0029] According to some aspects, the method further includes receiving, from thesecond apparatus, a second indication for a counting query over data at the first apparatus.

[0030] According to some aspects, the method further includes determining the data setby performing the counting query on the data.

[0031] According to some aspects, the method further includes transmitting, to thesecond apparatus, a third indication indicating a usage of a type of private data transfer.

[0032] According to some aspects, the method further includes receiving, from thesecond apparatus, one or more reference signals on the link; performing a measurement on the one or more reference signals; and obtaining the measurement metric bydetermining a Signal to Interference plus Noise Ratio (SINR) on the link based on themeasurement.

[0033] According to some aspects, the method further includes obtaining a symbol errorprobability for transmitting the data set based on a privacy parameter required by the dataset and the number of outputs of the counting query.

[0034] According to some aspects, the method further includes minimizing the symbolerror probability for transmitting the data set by adjusting the measurement metric.NC333554

[0035] According to some aspects, the method further includes minimizing the symbolerror probability for transmitting the data set by applying the channel coding to the dataset.

[0036] According to some aspects, the transmission property information is a probabilitytransition matrix related to the link.

[0037] In a fourth aspect of the present disclosure, there is provided a method. Themethod comprises: receiving, from a first apparatus, a first indication indicating that no channel coding is applied to a data set; receiving the data set from the first apparatus; and decoding the data set based on the first indication.

[0038] According to some aspects, the method further includes skipping channeldecoding on the data set based on the first indication.

[0039] According to some aspects, the method further includes transmitting, to the firstapparatus, a second indication for a counting query over data at the first apparatus.

[0040] According to some aspects, the method further includes receiving, from the firstapparatus, a third indication indicating a usage of a type of private data transfer.

[0041] In a fifth aspect of the present disclosure, there is provided a first apparatus. Thefirst apparatus comprises means for obtaining transmission property information of a link between the first apparatus and a second apparatus based on a measurement metric on the link; and means for obtaining a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.

[0042] In a sixth aspect of the present disclosure, there is provided a second apparatus.The second apparatus comprises means for receiving, from a first apparatus, a first indication indicating that no channel coding is applied to a data set; means for receiving the data set from the first apparatus; and means for decoding the data set based on the first indication.

[0043] In a seventh aspect of the present disclosure, there is provided a computerreadable medium. The computer readable medium comprises instructions stored thereon for causing an apparatus to perform at least the method according to any of the fourth,fifth, or sixth aspect.NC333554

[0044] According to some aspects, there is provided the subject matter of the independentclaims. Some further aspects are defined in the dependent claims.

[0045] It is to be understood that the Summary section is not intended to identify key oressential features of embodiments of the present disclosure, nor is it intended to be used to limit the scope of the present disclosure. Other features of the present disclosure will become easily comprehensible through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Some example embodiments will now be described with reference to theaccompanying drawings, where:

[0047] FIG. 1 illustrates an example communication environment in which exampleembodiments of the present disclosure can be implemented;

[0048] FIG. 2 illustrates a signaling chart for privacy enhanced data transmissionaccording to some example embodiments of the present disclosure;

[0049] FIG. 3 illustrates a schematic diagram of optimal error-privacy trade-offaccording to some example embodiments of the present disclosure;

[0050] FIG. 4 illustrates a flow chart of a method for obtaining a result related to channelcoding according to some example embodiments of the present disclosure;

[0051] FIG. 5 illustrates a flow chart of a method for obtaining a result related to channelcoding according to some example embodiments of the present disclosure;

[0052] FIG. 6 illustrates a flow chart of a method for obtaining a result related to channelcoding according to some further example embodiments of the present disclosure;

[0053] FIG. 7 illustrates a flow chart of find the optimal transfer matrix ^^∗according to some example embodiments of the present disclosure;

[0054] FIG. 8 illustrates a schematic diagram of an illustration of optimal private transfer(OPT) according to some example embodiments of the present disclosure;

[0055] FIG. 9A and FIG. 9B illustrate schematic diagrams of block chains at UE andgNB side according to some example embodiments of the present disclosure, respectively;

[0056] FIG. 10A and FIG. 10B illustrate constellation diagrams of 4-phase shit keying(4-PSK) and 8-PSK, respectively;NC333554

[0057] FIG. 11 illustrates a flowchart of a method implemented at a first apparatus inaccordance with some example embodiments of the present disclosure;

[0058] FIG. 12 illustrates a flowchart of a method implemented at a first apparatus inaccordance with some example embodiments of the present disclosure;

[0059] FIG. 13 illustrates a flowchart of a method implemented at a second apparatus inaccordance with some example embodiments of the present disclosure;

[0060] FIG. 14 illustrates a simplified block diagram of a device that is suitable forimplementing example embodiments of the present disclosure; and

[0061] FIG. 15 illustrates a block diagram of an example computer readable medium inaccordance with some example embodiments of the present disclosure.

[0062] Throughout the drawings, the same or similar reference numerals represent thesame or similar element. DETAILED DESCRIPTION

[0063] Principle of the present disclosure will now be described with reference to someexample embodiments. It is to be understood that these embodiments are described only for the purpose of illustration and help those skilled in the art to understand and implement the present disclosure, without suggesting any limitation as to the scope of the disclosure. Embodiments described herein can be implemented in various manners other than the ones described below.

[0064] In the following description and claims, unless defined otherwise, all technicaland scientific terms used herein have the same meaning as commonly understood by one of ordinary skills in the art to which this disclosure belongs.

[0065] References in the present disclosure to “one embodiment,” “an embodiment,” “anexample embodiment,” and the like indicate that the embodiment described may include a particular feature, structure, or characteristic, but it is not necessary that every embodiment includes the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature,NC333554 structure, or characteristic in connection with other embodiments whether or not explicitly described.

[0066] It shall be understood that although the terms “first,” “second,”…, etc. in front ofnoun(s) and the like may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another and they do not limit the order of the noun(s). For example, a first element could be termed a second element, and similarly, a second element could be termed a first element, without departing from the scope of example embodiments. As used herein, the term “and / or” includes any and all combinations of one or more of the listed terms.

[0067] As used herein, “at least one of the following: ”and “at least one of ” and similar wording, where the list of two or more elements are joined by “and” or “or”, mean at least any one of the elements, or at least any two or more of the elements, or at least all the elements.

[0068] As used herein, unless stated explicitly, performing a step “in response to A” doesnot indicate that the step is performed immediately after “A” occurs and one or more intervening steps may be included.

[0069] The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of example embodiments. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”, “comprising”, “has”, “having”, “includes” and / or “including”, when used herein, specify the presence of stated features, elements, and / or components etc., but do not preclude the presence or addition of one or more other features, elements, components and / or combinations thereof.

[0070] As used in this application, the term “circuitry” may refer to one or more or all ofthe following: (a) hardware-only circuit implementations (such as implementations in only analog and / or digital circuitry) and (b) combinations of hardware circuits and software, such as (as applicable): (i) a combination of analog and / or digital hardware circuit(s) with software / firmware andNC333554 (ii) any portions of hardware processor(s) with software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as a mobile phone or server, to perform various functions) and (c) hardware circuit(s) and or processor(s), such as a microprocessor(s) or a portion of a microprocessor(s), that requires software (e.g., firmware) for operation, but the software may not be present when it is not needed for operation.

[0071] This definition of circuitry applies to all uses of this term in this application,including in any claims. As a further example, as used in this application, the term circuitry also covers an implementation of merely a hardware circuit or processor (or multiple processors) or portion of a hardware circuit or processor and its (or their) accompanying software and / or firmware. The term circuitry also covers, for example and if applicable to the particular claim element, a baseband integrated circuit or processor integrated circuit for a mobile device or a similar integrated circuit in server, a cellular network device, or other computing or network device.

[0072] As used herein, the term “communication network” refers to a network followingany suitable communication standards, such as New Radio (NR), Long Term Evolution (LTE), LTE-Advanced (LTE-A), Wideband Code Division Multiple Access (WCDMA), High-Speed Packet Access (HSPA), Narrow Band Internet of Things (NB-IoT) and so on. Furthermore, the communications between a terminal device and a network device in the communication network may be performed according to any suitable generation communication protocols, including, but not limited to, the first generation (1G), the second generation (2G), 2.5G, 2.75G, the third generation (3G), the fourth generation (4G), 4.5G, the fifth generation (5G), 5.5G, the sixth generation (6G) communication protocols, and / or any other protocols either currently known or to be developed in the future. Embodiments of the present disclosure may be applied in various communication systems. Given the rapid development in communications, there will of course also be future type communication technologies and systems with which the present disclosure may be embodied. It should not be seen as limiting the scope of the present disclosure to only the aforementioned system.

[0073] As used herein, the term “network device” refers to a node in a communicationnetwork via which a terminal device accesses the network and receives services therefrom. The network device may refer to a base station (BS) or an access point (AP), for example,NC333554 a node B (NodeB or NB), an evolved NodeB (eNodeB or eNB), an NR NB (also referred to as a gNB), a Remote Radio Unit (RRU), a radio header (RH), a remote radio head (RRH), a relay, an Integrated Access and Backhaul (IAB) node, a low power node such as a femto, a pico, a non-terrestrial network (NTN) or non-ground network device such as a satellite network device, a low earth orbit (LEO) satellite and a geosynchronous earth orbit (GEO) satellite, an aircraft network device, and so forth, depending on the applied terminology and technology. In some example embodiments, radio access network (RAN) split architecture comprises a Centralized Unit (CU) and a Distributed Unit (DU) at an IAB donor node. An IAB node comprises a Mobile Terminal (IAB-MT) part that behaves like a UE toward the parent node, and a DU part of an IAB node behaves like a base station toward the next-hop IAB node.

[0074] The term “terminal device” refers to any end device that may be capable ofwireless communication. By way of example rather than limitation, a terminal device may also be referred to as a communication device, user equipment (UE), a Subscriber Station (SS), a Portable Subscriber Station, a Mobile Station (MS), or an Access Terminal (AT). The terminal device may include, but not limited to, a mobile phone, a cellular phone, a smart phone, voice over IP (VoIP) phones, wireless local loop phones, a tablet, a wearable terminal device, a personal digital assistant (PDA), portable computers, desktop computer, image capture terminal devices such as digital cameras, gaming terminal devices, music storage and playback appliances, vehicle-mounted wireless terminal devices, wireless endpoints, mobile stations, laptop-embedded equipment (LEE), laptop-mounted equipment (LME), USB dongles, smart devices, wireless customer-premises equipment (CPE), an Internet of Things (IoT) device, a watch or other wearable, a head-mounted display (HMD), a vehicle, a drone, a medical device and applications (e.g., remote surgery), an industrial device and applications (e.g., a robot and / or other wireless devices operating in an industrial and / or an automated processing chain contexts), a consumer electronics device, a device operating on commercial and / or industrial wireless networks, and the like. The terminal device may also correspond to a Mobile Termination (MT) part of an IAB node (e.g., a relay node). In the following description, the terms “terminal device”, “communication device”, “terminal”, “user equipment” and “UE” may be used interchangeably.

[0075] As used herein, the term “resource,” “transmission resource,” “resource block,”“physical resource block” (PRB), “uplink resource,” or “downlink resource” may refer toNC333554 any resource for performing a communication, for example, a communication between a terminal device and a network device, such as a resource in time domain, a resource in frequency domain, a resource in space domain, a resource in code domain, or any other combination of the time, frequency, space and / or code domain resource enabling a communication, and the like. In the following, unless explicitly stated, a resource in both frequency domain and time domain will be used as an example of a transmission resource for describing some example embodiments of the present disclosure. It is noted that example embodiments of the present disclosure are equally applicable to other resources in other domains.

[0076] The term “transmission property information” used herein may refer toinformation that reflect transmission characteristics of a link or channel. The term “measurement metric” used herein may refer to information used to quantity or assess the link or channel. For example, the measurement metric may include a certain result / information obtained by measurement. The term “privacy parameter” used herein may refer to specific criteria or standards that are used to ensure the privacy of individuals when their personal data is being collected, processed, stored, or shared, in context of data protection and information security. The term “symbol error probability” used herein may refer to a measure used in digital communications to quantify the likelihood that a symboltransmitted over a communication channel will be received incorrectly. For example, thesymbol error probability may indicate the probability that a transmitted symbol will be detected as a different symbol by the receiver.

[0077] It can be understood that, prior to the use of the technical solutions disclosed inembodiments of the present disclosure, data / privacy data related to the present disclosure, the usage scope, the usage scenario and the like should be notified to the user in an appropriate manner according to the relevant laws and regulations, and authorization should be obtained from the user. It is noted that the “privacy data” used in the present disclosure is obtained in a legal manner.

[0078] When sharing information about a group of individuals, differential Privacy is amethod of preserving the privacy of individuals by changing the original data in such a way that the resulting data cannot be used to infer much about any individual. Differential privacy (DP) proposed to give formal guarantee of privacy in case commonly used anonymization techniques (such as k-anonymity and l-divergence) are not sufficient.Therefore, it is worth studying the DP. The DP is proposed to give formal guarantee ofNC333554 privacy. For example, it assumes that two data sets^^and^^are neighbors (adjacent)if they differ in only one data entry (i.e., the data of an individual). Let ^ ≥ 0. Analgorithm / mechanism, which is a random mapping in general, is said to be ^ -differential private if: Pr(^(^^) ∈ ^) ≤ ^^ Pr(^(^^) ∈ ^),for all subsets ^ of image ofand all adjacent datasets ^^ and ^^.

[0079] The smaller the ^ , the harder it is to distinguish whether ^^ or ^^ hasgenerated the output of the algorithm, which in turn, makes the presence of an individual less likely to be noticed, since ^^or ^^differ in only one entry. Therefore, by lowering^ , the algorithm becomes more privacy-preserving. As a result, ^ can be called theprivacy loss.

[0080] Researching different mechanisms in data processing and communications toachieve privacy-for-free has led to many interesting works. For example, one solutionshows that dataset condensation, a method used for neural network training efficiency,can provide privacy in the sense of DP, as well. Another very successful machine learning approach, Bayesian models, has been considered. They have proved that any sample from a posterior distribution of a Bayesian model satisfies DP. A well-known lattice basedHomomorphic Encryption method, Cheon-Kim-Kim-Song (CKKS) scheme, is studied forits unintentional privacy enhancing impact. In another solution, a linear compressionmethod, coined as Sketching, is used to jointly decrease the communications overhead and privacy loss of a Federated learning setup. In purely wireless communication systems, works have investigated the connection between channel noise, hardware impairment and DP. Specifically, in a further solution, a power control mechanism is used to deliberately decrease the Signal to Noise Ratio (SNR). The lower SNR in an uncoded communication increases the error rate dramatically, thus lowers privacy loss in the DP sense. Hardware impairments, such as uncertainty induced using low-resolution Analogue to Digital Converters (ADC) have been demonstrated to be effective in providing some degrees of privacy. Compression techniques, i.e. source coding solutions, channel noise, and additive noise in Homomorphic encryption are all bestow great opportunity for accounting for privacy. One area that has not been studied for privacy is channel coding.

[0081] In an example solution, for each number of Quadrature Amplitude modulation(QAM) constellation points, they have plotted the curve of ^ (in the context of DP) versusNC333554 SNR, and based on these curves, it proposes to increase / decrease the number of constellation points to arrive at a desired level of privacy for a given SNR. However, the analysis is fixed to the quadrature amplitude modulation (QAM) constellation points, while in the present disclosure, a wide class of media is considered, which is not restricted to wireless communications. Moreover, even in their context, there is no investigation of optimal error-privacy trade-off and how to achieve it. Hence, there is no statement that their mechanism can attain the best utility for the provided level of privacy. Furthermore, they assume QAM constellations are selectable according to the required privacy gain, and it is this assumption that allows for meeting a privacy level. However, in a special use case of our results, which is uncoded Phase Shift Keying (PSK) modulation, the constellation points are fixed and we obtain the optimal possible error for a given privacy level, and show how to achieve it via a pre-mapping on the messages prior to being mapped to PSK constellation points.

[0082] In another solution, it proposes a re-adjustment of the codewords in Hammingcoding to enhance the privacy in transmission of the outputs of a counting query. However, according to this solution, there is no notion of optimal error-privacy trade-off and the analysis is restricted to a special type of channel coding, i.e., Hamming codes. Moreover,it provides a fixed value for ^ , which is not tunable.

[0083] In a further solution, it proposes a minor change in the hybrid automatic repeatrequest (HARQ) feedback system to enhance privacy at the gNB by deliberately not requesting re-submission of the failed packet. However, there is no optimality, no constellation consideration, and no generalizability to other information processing systems.

[0084] All of the above work are tailored only for wireless communications or channelcoding. However, the present disclosure is general to any information processing system,e.g., communications (modulation, coding, encryption, separate or jointly), storage(coding, encryption), central processing unit (CPU) / graphic processing unit (GPU) unitswhere in-processing error might arise, etc.

[0085] Assume that a message set {1, 2,...,M}, which denotes the output of a countingquery, needs to be transferred from a sender / source to a recipient / destination in a privatemanner, where the constraint of privacy is imposed by a required ^ in the context of DP.The messages needs to be sent as reliably as possible, where reliability (sometimes calledNC333554 utility / fidelity) is captured by how low the error probability in this transfer is, i.e., the lower the error probability, the more reliable the information transfer becomes. However, privacy and reliability are competing goals meaning that improvement in one comes at the cost of impairment in the other. Therefore, the problem is reduced to the following question: for a given medium (e.g., wireless channel) from the sender to the recipient anda given privacy requirement (^ ), what is the best reliability (minimum error probability),and how to achieve the best reliability.

[0086] More rigorously, let the medium from the sender to the recipient be captured bythe M-by-M probability transition matrix T. Also, let the M-by-M probability transition matrix P be a designable mapping applied to the messages prior to entering the medium from the sender to the recipient. Hence, the problem is to design P such that the errorprobability is minimized, while the product PT satisfies ^ -differential privacy.

[0087] What remains is to clarify the probability of error quantitatively. For any inputprobability distribution on the message set {1,2,...,M}, denoted by the probability mass vector w = (w_1,w_2,...,w_M), the probability of error in transferring information through PT is given bywhere d_i denotes the i-th diagonal element of PT. Hence, the evaluation of error probability requires knowledge of the input distribution w. However, DP is a distribution- agnostic requirement, i.e., a privacy-preserving mapping should be private regardless of whatever the input distribution is. As a result, due to uncertainty over the input distribution, one natural approach is the notion of robust optimization, i.e., minimizingthe worst possible error. In other words, it needs to find a mapping P that minimizes themaximum probability of error over all input distributions:

[0088] According to example embodiments of the present disclosure, it proposes achannel coding based differential privacy (DP) solution “Optimal Private Transfer (OPT)” for privacy-enhanced transmission via a medium, such as a wireless communication link between a UE and a gNB, of a data set obtained by a counting query on privacy-sensitive source data, utilizing naturally occurring channel noise for obfuscation of the data set withNC333554 optimal symbol error probability for a required level of privacy according to the DPvariable epsilon (ε). In this way, the give privacy requirement can be met with a minimumpossible symbol error rate.

[0089] FIG. 1 illustrates an example communication environment 100 in which exampleembodiments of the present disclosure can be implemented. In the communication environment 100, a plurality of communication devices, including a first apparatus 110 and a second apparatus 120, can communicate with each other. In some example embodiments, the first apparatus 110 may be a UE and the second apparatus 120 may be a base station serving the UE. Alternatively, the second apparatus 120 may be a UE and the first apparatus 110 may be a base station serving the UE.

[0090] It is to be understood that the number of devices and their connections shown inFIG. 1 are only for the purpose of illustration without suggesting any limitation. The communication environment 100 may include any suitable number of devices configured to implementing example embodiments of the present disclosure. Although not shown, it would be appreciated that one or more additional devices may be located in the cell, and one or more additional cells may be deployed in the communication environment 100. It is noted that although illustrated as a network device, the second apparatus 120 may be another device than a network device. Although illustrated as a terminal device, the first apparatus 110 may be another device than a terminal device.

[0091] In some example embodiments, a link from the second apparatus 120 to the firstapparatus 110 is referred to as a downlink (DL), while a link from the first apparatus 110 to the second apparatus 120 is referred to as an uplink (UL). In DL, the second apparatus 120 is a transmitting (TX) device (or a transmitter) and the first apparatus 110 is a receiving (RX) device (or a receiver). In UL, the first apparatus 110 is a TX device (or a transmitter) and the second apparatus 120 is a RX device (or a receiver).

[0092] Communications in the communication environment 100 may be implementedaccording to any proper communication protocol(s), comprising, but not limited to, cellular communication protocols of the first generation (1G), the second generation (2G), the third generation (3G), the fourth generation (4G), the fifth generation (5G), 5.5G, the sixth generation (6G), and the like, wireless local network communication protocols such as Institute for Electrical and Electronics Engineers (IEEE) 802.11 and the like, and / or any other protocols currently known or to be developed in the future. Moreover, theNC333554 communication may utilize any proper wireless communication technology, comprising but not limited to: Code Division Multiple Access (CDMA), Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), Frequency Division Duplex (FDD), Time Division Duplex (TDD), Multiple-Input Multiple-Output (MIMO), Orthogonal Frequency Division Multiple (OFDM), Discrete Fourier Transform spread OFDM (DFT-s-OFDM) and / or any other technologies currently known or to be developed in the future.

[0093] Example embodiments of the present disclosure will be described in detail belowwith reference to the accompanying drawings. It is noted that acts / steps described withreference to the following drawings can be combined in any suitable manner or can beimplemented separately. For example, one or more acts from one drawing can becombined with one or more acts from one or more other drawings.

[0094] Reference is made to FIG. 2, which illustrates a signaling flow 200 of privacyenhanced data transmission in accordance with some embodiments of the present disclosure. For the purpose of discussion, the signaling flow 200 will be discussed with reference to FIG.1, for example, by using the first apparatus 110 and the second apparatus 120. It is noted that the order of acts / steps shown in FIG. 2 is only an example not limitation.

[0095] The second apparatus 120 transmits (2010), to the first apparatus 110, anindication (referred to as “second indication”) for a counting query over data at the firstapparatus 110. That is, the first apparatus 110 receives (2010) the indication for thecounting query from the second apparatus 120. The indication for the counting query may be transmitted in any suitable signaling. Counting queries over tabular data may be one of most common types of queries, which have the form "how many rows in the databasehave the property X?" For example, each row could correspond to a survey respondent,and the property X may be “replied ‘yes’ to the survey”. As another example, each rowcould correspond to an individual patient, and the property X could be “being tested positive for a certain disease.” In the context of counting problems, the output of a query is an integer value, and since two neighboring datasets will have counts that differ by at most one, the adjacency constraint in the definition of differential privacy maps to the adjacency of integer numbers. In other words, adjacent numbers need to be made as indistinguishable as required depending on the choice of^.NC333554

[0096] The first apparatus 110 may determine the data set by performing the countingquery on the data. For example, the first apparatus 110 may obtain a message set {1,2,...,M}, which denotes the output of a counting query, needs to be transferred from thefirst apparatus 110 to the second apparatus 120 in a private manner, where the constraintof privacy is imposed by a required ^ in the context of DP.

[0097] The first apparatus 110 transmits (2015) an indication (referred to as “thirdindication”) indicating a usage of a type of private data transfer to the second apparatus120. That is, the second apparatus 120 receives (2015) the indication indicating the usageof the type of private data transfer from the first apparatus 110. For example, the third indication may indicate that the optimal private transfer (OPT) is used as private enhanced data transmission (PET).

[0098] The second apparatus 120 transmits (2020) one or more reference signals on alink between the first apparatus 110 and the second apparatus 120. That is, the firstapparatus 110 receives (2020) the one or more reference signals on the link from thesecond apparatus. In some example embodiments, the link may be a wireless channel. Alternatively, the link may be a wired channel.

[0099] In some example embodiments, the one or more reference signal may includechannel state information reference signals (CSI-RSs). Alternatively, the one or more reference signal may include synchronization signals. It is noted that the reference signal may include any proper types of reference signal.

[0100] The first apparatus 110 performs (2025) a measurement on the one or morereference signals. For example, the first apparatus 110 may measure reference signal received power on the one or more reference signals. Alternatively, the first apparatus 110 may measure a signal to interference plus noise ratio (SINR) on the link.

[0101] The first apparatus 110 obtains (2030) the measurement metric based on themeasurement. For example, the first apparatus 110 may determine the SINR on the link to be the measurement metric. It is noted the measurement metric may be any suitable measurement result that indicates the quality of the link.

[0102] The first apparatus 110 obtains (2035) transmission property information of thelink based on the measurement metric on the link. In some example embodiments, the transmission property information may be a probability transmission matrix related to theNC333554 link. As an example, it assumes that there are 5 messages {1,2,3,4,5} as the output of a counting query to be transmitted over the link of which the probability transmission matrix is given by:for this T, ^^ = 1.3 ,  ^^ = 0.51 and Q = I, since each diagonal element is the maximumof its corresponding column.

[0103] For example, for a given medium / link that can be captured by an M-by-Mprobability transition matrix T, the error-privacy trade-off can be obtained via a linearprogram (LP) in 3^^ − ^ + 1 variables. Hence, for any given pair (^ ,T), the minimumerror (^^⋅ (^)) and how to achieve it becomes fully known: The messages pass through the optimal mapping ^^⋅obtained via the LP and then through the given medium T. This approach minimizes the error probability while satisfying the privacy requirement, i.e., ^⋅^ ^ is ^ -differentially private. Linear programming (LP) may be a method for theoptimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region (i.e., the set of all points that satisfy the constraints) is a convex set, and the solution(s) of the LP is (are) located on the boundary of the feasible region.

[0104] Referring back to FIG. 2, in some example embodiments, the first apparatus 110determines (2040) whether to apply a channel coding on the data set. The first apparatus110 obtains (2045) a result related to the channel coding based on the transmissionproperty information and / or a first privacy parameter and a second privacy parameterrequired by the data set. Embodiments of obtaining the channel coding are describedbelow with reference to FIG.4 to FIG.6.

[0105] FIG. 4 shows a flow chart of a method 400 for obtaining a result related to channelcoding according to some example embodiments of the present disclosure. The method 400 may be implemented at the first apparatus 110.NC333554

[0106] At block 410, the first apparatus 110 obtains a target symbol error probabilitybased on the measurement metric and the transmission property information. For example,the target symbol error probability may be ^^ (^) =^^, where d_i denotes the i-th diagonal element of PT and input probability distribution on the message set {1,2,...,M}, denoted by the probability mass vector w = (w_1,w_2,...,w_M). Hence, the evaluation of error probability requires knowledge of the input distribution w.

[0107] At block 420, the first apparatus 110 determines whether the target symbol errorprobability matches a reference symbol error probability. By way of example, the firstapparatus 110 determines whether the target symbol error probability is equal to the reference symbol error probability. For example, assume an imaginary scenario where T is the identity channel matrix, (i.e., the medium is error-free.), the probability of error in this imaginary scenario is a lower bound on the error probability for an arbitrary T. Again, the solution to this problem can be obtained via an LP. However, it turns out that in this case, it can get a closed-form solution. In this case, the optimal probability of error (i.e., a reference symbol error probability) is given by:where ^^∗represents the reference symbol error probability, M represents a size of theprobability transition matrix, ^ represents a privacy parameter, and which can be achieved bythe following mapping:which is a circulant, symmetric doubly stochastic matrix.

[0108] Now, for a given T = [^^,^], define three quantities as follows. Let ^^ denote theprivacy level that T itself offers, i.e.,NC333554

[0109] Let Q be a matrix which has a 1 and (M − 1) zeros in each row, where the positionof 1 in row ^ is the row index of the maximum element in column ^ of T. With thesedefinitions, it can get upper and lower bounds on the optimal error probability as follows:where the notation [^]^,^ denotes the i-th diagonal element of A and ^^ = 1 − m^in[^^]^,^.Moreover, there may be

[0110] An example of the optimal error-privacy trade-off along with the proposedupper / lower bounds is shown in FIG. 3. The curve 310 is obtained via an LP and at each^ an optimal mapping is derived. As expected, it is non-increasing in ^ and when ^ ≥^^, i.e., when the privacy level of T itself satisfies the privacy requirement, the curve is flat and no mapping prior to T is required (it becomes the identity matrix in the LP). Thecurve 320 serves as the upper bound and the curve 330 serves as the lower bound on theoptimal error probability. The curve 330 is the optimal error probability in the aforementioned imaginary scenario with T = I, which has a closed-form solution. It isworth noting that in the high privacy regime (low values of ^ ), the curves 310 and 330coincide. This, in turn, means that: i) it has reached the fundamental limit on the error probability in the high privacy regime simply by a precoding prior to this T, and ii) it can get the optimal mapping in this regime as a closed-form solution simply with multiplying ^⋅by the inverse of T (soon, it shows that if T is not invertible, it cannot reach thefundamental limit for any ^ > 0 ) .

[0111] At block 430, the first apparatus 110 obtains the result indicating no applying thechannel coding, if the target symbol error probability matches the reference symbol errorprobability. For example, if the target symbol error probability is equal to the referencesymbol error probability, the result indicates not to apply the channel coding. At block 440, the first apparatus 110 may obtain the result indicating applying the channel coding,if the target symbol error probability does not match the reference symbol errorprobability. For example, if the target symbol error probability is not equal to the reference symbol error probability, the result indicates applying the channel coding.NC333554

[0112] FIG. 5 shows a flow chart of a method 500 for obtaining a result related to channelcoding according to some example embodiments of the present disclosure. The method 400 may be implemented at the first apparatus 110.

[0113] At block 510, the first apparatus 110 obtains a target symbol error probabilitybased on the measurement metric and the transmission property information. For example,the target symbol error probability may be ^^ (^) =^^, where d_i denotes the i-th diagonal element of PT and input probability distribution on the message set {1,2,...,M}, denoted by the probability mass vector w = (w_1,w_2,...,w_M). Hence, the evaluation of error probability requires knowledge of the input distribution w.

[0114] At block 520, the first apparatus 110 determines whether the target symbol errorprobability is equal to the reference symbol error probability. At block 530, the firstapparatus 110 obtains the result indicating no applying the channel coding, if the targetsymbol error probability is equal to the reference symbol error probability. At block 540, the first apparatus 110 may obtain the result indicating applying the channel coding, if the target symbol error probability is not equal to the reference symbol error probability.

[0115] FIG. 6 shows a flow chart of a method 600 for obtaining a result related to channelcoding according to some other example embodiments of the present disclosure. The method 600 may be implemented at the first apparatus 110.

[0116] At block 610, the first apparatus 110 finds the optimal ^^∗based on algorithm 1.Table 1 shows the algorithm 1 of finding the optimal symbol error probability.Table 1NC333554

[0117] FIG. 7 shows a flow chart of algorithm 1 according to some example embodimentsof the present disclosure.

[0118] At block 710, the first apparatus 110 uses the signal noise ratio (for example,obtained at 2030), the second privacy parameter (^) and modulation order as the input. Atblock 720, the first apparatus 110 obtains the transition matrix T from the SNR, the secondprivacy parameter and the modulation order and may then obtain optimal symbol errorprobability (^^∗), optimal transition matrix (^∗), a matrix which as a one and M-1 zeros in each row (^^), a parameters (^^), and the second privacy parameter (^^).

[0119] For example, when M is equal to 5, ^∗ may be obtained by

[0121] Moreover, ^^ may be obtained by:. Embodiments ofobtaining ^^∗and ^^are shown above, which are omitted here.NC333554

[0122] At block 730, the first apparatus 110 determines whether the second privacyparameter is above or equal to the first privacy parameter (i.e., if ε ≥^^?). If the second privacy parameter is above or equal to the first privacy parameter, the first apparatus 110 may determine ^^∗(T) =^^and ^∗^ =^^.

[0123] At block 740, if the second privacy parameter is below the first privacy parameter,the first apparatus 110 determines if det(T) ≠0 & ^∗ ^^^ is a stochastic matrix is trueor not. If it is true, the first apparatus 110 may determine ^∗^ (T) =If it is not true, at block 750, the first apparatus 110 may use linear programming to solvefor ^^∗and ^∗^ . That is, the linear programming may be used to optimize the privacyparameter.

[0124] Referring back to FIG. 6, at block 615, the first apparatus 110 finds if the curvefalls on the optimal curve based on the SINR and plot shown in FIG. 8. As stated earlier,^∗(i.e., the imaginary scenario), is a circulant and symmetric doubly stochastic matrix, which is a property that also applies to the transition probability of an M-ary phase shiftkeying (PSK) in Additive White Gaussian Noise (AWGN) channels. Hence, it makessense to evaluate the trade-off when the medium is M-PSK signaling in AWGN channels. Unless for M = 2 or M = 4, the transition probability of M-PSK, i.e., T, does not have a closed form solution and has to be obtained numerically. As an example, as shown in FIG. 8, for the message size M = 8, and T denoting the probability transition matrix of 8-PSK signaling in AWGN channel, the optimal error-privacy trade-off is plotted in figure below for several values of SNR. As it can be observed, by increasing the SNR, the curves get closer to the fundamental limit (i.e., the imaginary scenario with T=I) with the intuitive justification that by increasing SNR, T gets ”closer” to the identity matrix (I).

[0125] At block 620, the first apparatus 110 determines whether the optimal symbol errorprobability meets the reference symbol error probability. That is, the first apparatus 110determines whether the optimal error probability falls on (or close to) the curve (shownin FIG. 8). In some example embodiments, as shown in FIG. 8, the high privacy regime(i.e., low ^), optimal error probability reaches its fundamental limit, meaning that in thehigh privacy regime, uncoded transmission is optimal (i.e., the channel coding is notneeded). Moreover, FIG. 8 also shows bounds on sufficient SNRs to meet a certainprivacy level. For instance, if ^ = 1, there is no gain (in terms of lowering the errorprobability) in increasing the SNR beyond 3 dB. This contrasts with the conventionalNC333554 information transmission without privacy requirements, in which, the more the SNR, thelower the probability of error. Here, for any given ^ , there is a minimum level of SNR,above which the probability of error remains intact. Finally, since T does not have a closedform solution, one can always obtain it numerically and check if it is invertible, which indeed seems to be the case according to several experiments. The present disclosureprovides a sufficient condition such that for high privacy regime, the trade-off by uncodedtransmission coincides with the fundamental limit. This sufficient condition is that the symbol error probability is larger than 0.5.

[0126] At block 630, if the optimal symbol error probability meets the reference symbolerror probability, the first apparatus 110 obtains the result indicating not applying thechannel coding. For example, as shown in FIG. 8, for the ^ is equal to 2 and the SNR isequal to 3dB, if the optimal symbol error probability meets / matches the curve, the firstapparatus 110 may determine that the channel coding is not needed. Alternatively, if theoptimal symbol error probability does not the reference symbol error probability, the firstapparatus 110 may obtain the result indicating applying the channel coding.

[0127] Reference is made back to FIG. 2. In some example embodiments, the firstapparatus 110 transmits (2050) an indication (referred to as “first indication”) indicatingthat no channel coding is applied to the data set. For example, if the result indicates thatno channel coding is applied to the data set, the first apparatus 110 transmits (2050) theindication to the second apparatus 120. That is, the second apparatus 120 receives (2050)the indication indicating that no channel coding is applied to the data set from the firstapparatus 110.

[0128] In some example embodiments, the first apparatus 110 minimizes (2060) thesymbol error probability by adjusting the measurement metric. For example, as shown inFIG. 8, for a given ^ (such as, 3), the symbol error probability can be minimized byincreasing the SINR. By way of example, the first apparatus 110 may increasetransmission power for transmitting the data set, thereby improving the SINR. In someother example embodiments, the first apparatus 110 may minimize the symbol errorprobability by applying the channel coding to the data set.

[0129] The first apparatus 110 applies (2065) or skips (2065) applying the channelcoding based on the result. For example, the first apparatus skips applying the channelcoding, if the result indicates not to apply the channel coding.NC333554

[0130] Alternatively, the first apparatus 110 applies the channel coding, if the resultindicates applying the channel coding. The first apparatus 110 transmits (2070) the dataset to the second apparatus 120. After receiving the data set from the first apparatus 110,the second apparatus 120 decodes (2075) the data set. For example, if the second apparatus120 receives (2050) the first indication from the first apparatus 110, the second apparatus120 decodes the data set without channel decoding. Alternatively, if the second apparatus120 does not receive the first indication, the second apparatus 120 may decode the dataset with the channel decoding.

[0131] FIG. 9A illustrates a schematic diagram of block chain where no channel codingis applied. As shown in FIG. 9A, the transmission property information (for example, theprobability transition matrix T) may be computed from the SNR, coding and modulationat block 911. The probability transition matrix ( ^∗^ ) may be computed from thetransmission property information and the privacy parameter at block 912. The firstapparatus 110 may determine that a “minimum” probability of error can be achieved basedon the probability transition matrix and the given ^, at block 913. The first apparatus 110may perform the modulation and mapping on the data set at block 914, without channelcoding. For example, the first apparatus 110 may map the data set to a set of constellationpoints in the complex plane, which are then translated to (sine / cosine) waveforms with a carrier frequency for transmission. In some example embodiments, a modulation schemecalled Phase Shift Keying (PSK) may be used, where the information is modulated onlyin the phase of the constellation. In this context, the M messages are mapped to M equally spaced points on a circle of radiusin the complex plane, where ^^denotes the energy per symbol. Complex zero-mean Gaussian noise (with equal variance in the in- phase and quadrature) is added to these points to make the received noisy messages at the receiver, which then pass through a nearest neighbor detector to recover the originalmessage symbols. An example of 4-PSK and 8-PSK constellation points are provided inFIG. 10A and FIG. 10B. One advantage of PSK modulation is that since all theconstellation points have the same distance from origin, the average SNR does not dependon the input distribution. It is noted the other modulation schemes may also be applicable.The modulated data may then be processed using one or more common radio processingunits at block 915 and then transmitted to the second apparatus 120 via the channelbetween the first apparatus 110 and the second apparatus 120. After receiving the datafrom the first apparatus 110, the second apparatus 120 may remove the radio processingNC333554 effects from the received data at block 916. Demodulation and de-mapping may beperformed on the data at block 917. Finally, the second apparatus 120 may obtain the DPenhanced data.

[0132] FIG. 9B illustrates a schematic diagram of block chain wherein the channelcoding is applied. As shown in FIG. 9B, the transmission property information (forexample, the probability transition matrix T) may be computed from the SNR, coding andmodulation at block 921. The probability transition matrix (^∗^ ) may be computed fromthe transmission property information and the privacy parameter at block 922. The firstapparatus 110 may determine that a “minimum” probability of error cannot be achievedbased on the probability transition matrix and the given ^ , at block 923. The firstapparatus 110 may perform the channel coding at block 924. After the channel coding,the first apparatus 110 may perform the modulation and mapping on the data set at block925. The modulated data may then be processed using one or more common radioprocessing units at block 926 and then transmitted to the second apparatus 120 via thechannel between the first apparatus 110 and the second apparatus 120. After receiving thedata from the first apparatus 110, the second apparatus 120 may remove the radio processing effects from the received data at block 927. Demodulation and de-mappingmay be performed on the data at block 928. After the demodulation, the second apparatusmay perform the channel decoding on the demodulated data at block 929. Finally, thesecond apparatus 120 may obtain the DP enhanced data. With coded communications, thepresent disclosure can achieve smaller probability of error. Since channel codingcompensates for the errors made by the channel, same as higher SNR.

[0133] In some example embodiments, the second apparatus 120 transmits (2080) one ormore further reference signals to the first apparatus 110. In this case, after receiving theone or more further reference signals, the first apparatus 110 may perform themeasurement on the one or more further reference signals to obtain the measurement metric (such as, SNR or SINR). It is noted that the one or more of acts (2025 to 2080) may be repeated for serval times.

[0134] According to example embodiments described with reference to FIG. 2, itproposes a channel coding based differential privacy (DP) solution “Optimal Private Transfer (OPT)” for privacy-enhanced transmission via a medium, such as a wirelesscommunication link between the UE and the gNB, of the data set obtained by a countingNC333554 query on privacy-sensitive source data, utilizing naturally occurring channel noise for obfuscation of the data set with optimal symbol error probability for a required level ofprivacy according to an upper bound of the DP variable epsilon (ε). Further, resources canbe saved without the channel coding, while the privacy requirements can still be met. Itshould be noted that the steps as illustrated in FIG. 2 to FIG. 8 can be selectively performed in an actual implementation.

[0135] FIG. 11 shows a flowchart of an example method 1100 implemented at a firstapparatus in accordance with some example embodiments of the present disclosure. For example, the method 1100 may be implemented at the first apparatus 110 in FIG.1.

[0136] At block 1110, the first apparatus obtains transmission property information of alink between the first apparatus and a second apparatus based on a measurement metric on the link.

[0137] At block 1120, the first apparatus obtains a result associated with a channelcoding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.

[0138] In some example embodiments, the method 1100 further comprises: skippingapplying the channel coding to the data set based on the result. In this way, resources canbe saved, since no channel coding is needed.

[0139] In some example embodiments, the result indicates not to apply the channelcoding based on a determination that a target symbol error probability obtained based onthe measurement metric and the transmission property information matches a referencesymbol error probability. In some example embodiments, the result indicates not to applythe channel coding based on a determination that the target symbol error probability is equal to the reference symbol error probability.

[0140] In some example embodiments, the method 1100 further comprises: applying thechannel coding to the data set based on the result. In this way, it can improve reliabilityof the transmission between the first apparatus and the second apparatus.

[0141] In some example embodiments, the result indicates applying the channel codingbased on a determination that a target symbol error probability obtained based on themeasurement metric and the transmission property information does not match a referencesymbol error probability. In some example embodiments, the result indicates applying theNC333554 channel coding based on a determination that the target symbol error probability is not equal to the reference symbol error probability.

[0142] In some example embodiments, the method 1100 further comprises: based on adetermination that the channel coding is not applied to the data set, transmitting to the second apparatus, a first indication indicating that no channel coding is applied to the dataset. In this way, the second apparatus can decode the data set is a proper way based on thefirst indication.

[0143] In some example embodiments, the method 1100 further comprises: receiving,from the second apparatus, a second indication for a counting query over data at the first apparatus.

[0144] In some example embodiments, the method 1100 further comprises: determiningthe data set by performing the counting query on the data.

[0145] In some example embodiments, the method 1100 further comprises: transmitting,to the second apparatus, a third indication indicating a usage of a type of private datatransfer. In this way, both the first apparatus and the second apparatus know which typeof the private data transfer is used, thereby avoiding misunderstanding.

[0146] In some example embodiments, the method 1100 further comprises: receiving,from the second apparatus, one or more reference signals on the link; performing a measurement on the one or more reference signals; and obtaining the measurement metric by determining a Signal to Interference plus Noise Ratio (SINR) on the link based on the measurement.

[0147] In some example embodiments, the first apparatus is caused to: obtaining asymbol error probability for transmitting the data set based on a privacy parameter required by the data set and the number of outputs of the counting query.

[0148] In some example embodiments, the method 1100 further comprises: minimizingthe symbol error probability for transmitting the data set by adjusting the measurementmetric. In this way, it can smaller symbol error probability and improve thecommunication reliability.

[0149] In some example embodiments, the method 1100 further comprises: minimizingthe symbol error probability for transmitting the data set by applying the channel codingNC333554to the data set. In this way, it can smaller symbol error probability and improve thecommunication reliability.

[0150] In some example embodiments, the transmission property information is aprobability transition matrix related to the link.

[0151] In some example embodiments, the first apparatus is a terminal device and thesecond apparatus is a network device.

[0152] FIG. 12 shows a flowchart of an example method 1200 implemented at a firstapparatus in accordance with some example embodiments of the present disclosure. Forexample, the method 1200 may be implemented at the first apparatus 110 in FIG. 1.

[0153] At block 1210, the first apparatus 110 obtains transmission property informationof a link between the first apparatus and a second apparatus based on a measurement metric one the link.

[0154] At block 1220, the first apparatus 110 obtains a first privacy parameter based onthe transmission property information.

[0155] At block 1230, the first apparatus 110 obtains a result associated with a channelcoding to a data set used for transmitting to the second apparatus on the link, based on at least one of: the first privacy parameter, a second privacy parameter required by the data set, the measurement metric, or the transmission property information.

[0156] In some example embodiments, the method 1200 further comprises: skippingapplying the channel coding to the data set based on the result. In this way, resources canbe saved, since no channel coding is needed.

[0157] In some example embodiments, the result indicates not to apply the channelcoding based on a determination that the second privacy parameter is below the first privacy parameter and that a target symbol error probability obtained based on themeasurement metric and the transmission property information matches a referencesymbol error probability.

[0158] In some example embodiments, the method 1200 further comprises: applying thechannel coding to the data set based on the result. In this way, it can improve reliabilityof the transmission between the first apparatus and the second apparatus.NC333554

[0159] In some example embodiments, the result indicates not to apply the channelcoding based on a determination that the second privacy parameter is below the first privacy parameter and that a target symbol error probability obtained based on themeasurement metric and the transmission property information does not match a referencesymbol error probability.

[0160] In some example embodiments, the method 1200 further comprises: based on adetermination that the channel coding is not applied to the data set, transmitting to the second apparatus, a first indication indicating that no channel coding is applied to the dataset. In this way, the second apparatus can decode the data set is a proper way based on thefirst indication.

[0161] In some example embodiments, the method 1200 further comprises: receiving,from the second apparatus, a second indication for a counting query over data at the first apparatus.

[0162] In some example embodiments, the method 1200 further comprises: determiningthe data set by performing the counting query on the data.

[0163] In some example embodiments, the method 1200 further comprises: transmitting,to the second apparatus, a third indication indicating a usage of a type of private datatransfer. In this way, both the first apparatus and the second apparatus know which typeof the private data transfer is used, thereby avoiding misunderstanding.

[0164] In some example embodiments, the method 1200 further comprises: obtaining asymbol error probability for transmitting the data set based on the second privacy parameter required by the data set and the number of outputs of the counting query.

[0165] In some example embodiments, the method 1200 further comprises: minimizingthe symbol error probability for transmitting the data set by adjusting the measurementmetric. In this way, it can smaller symbol error probability and improve thecommunication reliability.

[0166] In some example embodiments, the method 1200 further comprises: minimizingthe symbol error probability for transmitting the data set by applying the channel codingto the data set. In this way, it can smaller symbol error probability and improve thecommunication reliability.NC333554

[0167] In some example embodiments, the transmission property information is aprobability transition matrix related to the link.

[0168] In some example embodiments, the method 1200 further comprises: receiving,from the second apparatus, one or more reference signals on the link; performing a measurement on the one or more reference signals; and obtaining the measurement metric by determining a Signal to Interference plus Noise Ratio (SINR) on the link based on the measurement.

[0169] In some example embodiments, the first apparatus is a terminal device and thesecond apparatus is a network device.

[0170] FIG. 13 shows a flowchart of an example method 1300 implemented at a secondapparatus in accordance with some example embodiments of the present disclosure. For example, the method 1300 may be implemented at the second apparatus 120 in FIG. 1.

[0171] At block 1310, the second apparatus receives, from a first apparatus, a firstindication indicating that no channel coding is applied to a data set.

[0172] At block 1320, the second apparatus receives the data set from the first apparatus.

[0173] At block 1330, the second apparatus decodes the data set based on the firstindication. In this way, the second apparatus can decode the data set is a proper way basedon the first indication.

[0174] In some example embodiments, the method 1300 further comprises: skippingchannel decoding on the data set based on the first indication. In this way, resources canbe saved, since no channel decoding is needed.

[0175] In some example embodiments, the method 1300 further comprises: transmitting,to the first apparatus, a second indication for a counting query over data at the first apparatus.

[0176] In some example embodiments, the first second is caused to: receiving, from thefirst apparatus, a third indication indicating a usage of a type of private data transfer. Inthis way, both the first apparatus and the second apparatus know which type of the privatedata transfer is used, thereby avoiding misunderstanding.

[0177] In some example embodiments, the first apparatus is a terminal device and thesecond apparatus is a network device.NC333554

[0178] In some example embodiments, a first apparatus capable of performing any of themethod 1100 (for example, the first apparatus 110 in FIG. 1) may comprise means forperforming the respective operations of the method 1100. The means may be implemented in any suitable form. For example, the means may be implemented in a circuitry or software module. The first apparatus may be implemented as or included in the firstapparatus 110 in FIG. 1.

[0179] In some example embodiments, the first apparatus comprises means for obtainingtransmission property information of a link between the first apparatus and a second apparatus based on a measurement metric on the link; and means for obtaining a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.

[0180] In some example embodiments, the first apparatus further comprises: means forskipping applying the channel coding to the data set based on the result.

[0181] In some example embodiments, the result indicates not to apply the channelcoding based on a determination that a target symbol error probability obtained based onthe measurement metric and the transmission property information matches a referencesymbol error probability.

[0182] In some example embodiments, the first apparatus further comprises: means forapplying the channel coding to the data set based on the result.

[0183] In some example embodiments, the result indicates applying the channel codingbased on a determination that a target symbol error probability obtained based on themeasurement metric and the transmission property information does not match a referencesymbol error probability.

[0184] In some example embodiments, the first apparatus further comprises: means forbased on a determination that the channel coding is not applied to the data set, transmitting to the second apparatus, a first indication indicating that no channel coding is applied to the data set.

[0185] In some example embodiments, the first apparatus further comprises: means forreceiving, from the second apparatus, a second indication for a counting query over data at the first apparatus.NC333554

[0186] In some example embodiments, the first apparatus further comprises: means fordetermining the data set by performing the counting query on the data.

[0187] In some example embodiments, the first apparatus further comprises: means fortransmitting, to the second apparatus, a third indication indicating a usage of a type of private data transfer.

[0188] In some example embodiments, the first apparatus further comprises: means forreceiving, from the second apparatus, one or more reference signals on the link; means for performing a measurement on the one or more reference signals; and means for obtaining the measurement metric by determining a Signal to Interference plus Noise Ratio (SINR) on the link based on the measurement.

[0189] In some example embodiments, the first apparatus further comprises means forobtaining a symbol error probability for transmitting the data set based on a privacy parameter required by the data set and the number of outputs of the counting query.

[0190] In some example embodiments, the first apparatus further comprises: means forminimizing the symbol error probability for transmitting the data set by adjusting the measurement metric.

[0191] In some example embodiments, the first apparatus further comprises: means forminimizing the symbol error probability for transmitting the data set by applying the channel coding to the data set.

[0192] In some example embodiments, the transmission property information is aprobability transition matrix related to the link.

[0193] In some example embodiments, the first apparatus is a terminal device and thesecond apparatus is a network device.

[0194] In some example embodiments, a first apparatus capable of performing any of themethod 1200 (for example, the first apparatus 110 in FIG. 1) may comprise means for performing the respective operations of the method 1200. The means may be implemented in any suitable form. For example, the means may be implemented in a circuitry or software module. The first apparatus may be implemented as or included in the first apparatus 110.NC333554

[0195] In some example embodiments, the first apparatus comprises means for obtainingtransmission property information of a link between the first apparatus and a second apparatus based on a measurement metric one the link; means for obtaining a first privacy parameter based on the transmission property information; and means for obtaining a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on at least one of: the first privacy parameter, a second privacy parameter required by the data set, the measurement metric, or the transmission property information.

[0196] In some example embodiments, the first apparatus further comprises: means forskipping applying the channel coding to the data set based on the result.

[0197] In some example embodiments, the result indicates not to apply the channelcoding based on a determination that the second privacy parameter is below the first privacy parameter and that a target symbol error probability obtained based on themeasurement metric and the transmission property information matches a referencesymbol error probability.

[0198] In some example embodiments, the first apparatus further comprises: means forapplying the channel coding to the data set based on the result.

[0199] In some example embodiments, the result indicates not to apply the channelcoding based on a determination that the second privacy parameter is below the first privacy parameter and that a target symbol error probability obtained based on themeasurement metric and the transmission property information does not match a referencesymbol error probability.

[0200] In some example embodiments, the first apparatus further comprises: means forbased on a determination that the channel coding is not applied to the data set, transmitting to the second apparatus, a first indication indicating that no channel coding is applied to the data set.

[0201] In some example embodiments, the first apparatus further comprises: means forreceiving, from the second apparatus, a second indication for a counting query over data at the first apparatus.

[0202] In some example embodiments, the first apparatus further comprises: means fordetermining the data set by performing the counting query on the data.NC333554

[0203] In some example embodiments, the first apparatus further comprises: means fortransmitting, to the second apparatus, a third indication indicating a usage of a type of private data transfer.

[0204] In some example embodiments, the first apparatus further comprises: means forobtaining a symbol error probability for transmitting the data set based on the second privacy parameter required by the data set and the number of outputs of the counting query.

[0205] In some example embodiments, the first apparatus further comprises: means forminimizing the symbol error probability for transmitting the data set by adjusting the measurement metric.

[0206] In some example embodiments, the first apparatus further comprises: means forminimizing the symbol error probability for transmitting the data set by applying the channel coding to the data set.

[0207] In some example embodiments, the transmission property information is aprobability transition matrix related to the link.

[0208] In some example embodiments, the first apparatus further comprises: means forreceiving, from the second apparatus, one or more reference signals on the link; means for performing a measurement on the one or more reference signals; and means for obtaining the measurement metric by determining a Signal to Interference plus Noise Ratio (SINR) on the link based on the measurement.

[0209] In some example embodiments, the first apparatus is a terminal device and thesecond apparatus is a network device.

[0210] In some example embodiments, a second apparatus capable of performing any ofthe method 1300 (for example, the second apparatus 120 in FIG. 1) may comprise meansfor performing the respective operations of the method 1300. The means may be implemented in any suitable form. For example, the means may be implemented in a circuitry or software module. The second apparatus may be implemented as or includedin the second apparatus 120 in FIG. 1.

[0211] In some example embodiments, the second apparatus comprises means forreceiving, from a first apparatus, a first indication indicating that no channel coding is applied to a data set; means for receiving the data set from the first apparatus; and means for decoding the data set based on the first indication.NC333554

[0212] In some example embodiments, the second apparatus further comprises: meansfor skipping channel decoding on the data set based on the first indication.

[0213] In some example embodiments, the second apparatus further comprises: meansfor transmitting, to the first apparatus, a second indication for a counting query over data at the first apparatus.

[0214] In some example embodiments, the first second is caused to: means for receiving,from the first apparatus, a third indication indicating a usage of a type of private data transfer.

[0215] In some example embodiments, the first apparatus is a terminal device and thesecond apparatus is a network device.

[0216] FIG. 14 is a simplified block diagram of a device 1400 that is suitable forimplementing example embodiments of the present disclosure. The device 1400 may beprovided to implement a communication device, for example, the first apparatus 110 orthe second device apparatus as shown in FIG. 1. As shown, the device 1400 includes oneor more processors 1410, one or more memories 1420 coupled to the processor 1410, and one or more communication modules 1440 coupled to the processor 1410.

[0217] The communication module 1440 is for bidirectional communications. Thecommunication module 1440 has one or more communication interfaces to facilitate communication with one or more other modules or devices. The communication interfaces may represent any interface that is necessary for communication with other network elements. In some example embodiments, the communication module 1440 may include at least one antenna.

[0218] The processor 1410 may be of any type suitable to the local technical networkand may include one or more of the following: general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on multicore processor architecture, as non-limiting examples. The device 1400 may have multiple processors, such as an application specific integrated circuit chip that is slaved in time to a clock which synchronizes the main processor.

[0219] The memory 1420 may include one or more non-volatile memories and one ormore volatile memories. Examples of the non-volatile memories include, but are not limited to, a Read Only Memory (ROM) 1424, an electrically programmable read onlyNC333554 memory (EPROM), a flash memory, a hard disk, a compact disc (CD), a digital video disk (DVD), an optical disk, a laser disk, and other magnetic storage and / or optical storage. Examples of the volatile memories include, but are not limited to, a random-access memory (RAM) 1422 and other volatile memories that will not last in the power-down duration.

[0220] A computer program 1430 includes computer executable instructions that areexecuted by the associated processor 1410. The instructions of the program 1430 may include instructions for performing operations / acts of some example embodiments of the present disclosure. The program 1430 may be stored in the memory, e.g., the ROM 1424. The processor 1410 may perform any suitable actions and processing by loading the program 1430 into the RAM 1422.

[0221] The example embodiments of the present disclosure may be implemented bymeans of the program 1430 so that the device 1400 may perform any process of the disclosure as discussed with reference to FIG.2 to FIG.13. The example embodiments of the present disclosure may also be implemented by hardware or by a combination of software and hardware.

[0222] In some example embodiments, the program 1430 may be tangibly contained in acomputer readable medium which may be included in the device 1400 (such as in the memory 1420) or other storage devices that are accessible by the device 1400. The device 1400 may load the program 1430 from the computer readable medium to the RAM 1422 for execution. In some example embodiments, the computer readable medium may include any types of non-transitory storage medium, such as ROM, EPROM, a flash memory, a hard disk, CD, DVD, and the like. The term “non-transitory,” as used herein, is a limitation of the medium itself (i.e., tangible, not a signal) as opposed to a limitation on data storage persistency (e.g., RAM vs. ROM).

[0223] FIG. 15 shows an example of the computer readable medium 1500 which may bein form of CD, DVD or other optical storage disk. The computer readable medium 1500 has the program 1430 stored thereon.

[0224] Generally, various embodiments of the present disclosure may be implemented inhardware or special purpose circuits, software, logic or any combination thereof. Some aspects may be implemented in hardware, and other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or otherNC333554 computing device. Although various aspects of embodiments of the present disclosure are illustrated and described as block diagrams, flowcharts, or using some other pictorial representations, it is to be understood that the block, apparatus, system, technique or method described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.

[0225] Some example embodiments of the present disclosure also provide at least onecomputer program product tangibly stored on a computer readable medium, such as a non- transitory computer readable medium. The computer program product includes computer- executable instructions, such as those included in program modules, being executed in a device on a target physical or virtual processor, to carry out any of the methods as described above. Generally, program modules include routines, programs, libraries,objects, classes, components, data structures, or the like that perform particular tasks orimplement particular abstract data types. The functionality of the program modules may be combined or split between program modules as desired in various embodiments. Machine-executable instructions for program modules may be executed within a local or distributed device. In a distributed device, program modules may be located in both local and remote storage media.

[0226] Program code for carrying out methods of the present disclosure may be writtenin any combination of one or more programming languages. The program code may be provided to a processor or controller of a general-purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program code, when executed by the processor or controller, cause the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code may execute entirely on a machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

[0227] In the context of the present disclosure, the computer program code or relateddata may be carried by any suitable carrier to enable the device, apparatus or processor to perform various processes and operations as described above. Examples of the carrier include a signal, computer readable medium, and the like.

[0228] The computer readable medium may be a computer readable signal medium or acomputer readable storage medium. A computer readable medium may include but notNC333554 limited to an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of the computer readable storage medium would include an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random-access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0229] Further, although operations are depicted in a particular order, this should not beunderstood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, although several specific implementation details are contained in the above discussions, these should not be construed as limitations on the scope of the present disclosure, but rather as descriptions of features that may be specific to particular embodiments. Unless explicitly stated, certain features that are described in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, unless explicitly stated, various features that are described in the context of a single embodiment may also be implemented in a plurality of embodiments separately or in any suitable sub-combination.

[0230] Although the present disclosure has been described in languages specific tostructural features and / or methodological acts, it is to be understood that the present disclosure defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

Claims

NC333554 Claims:

1. A first apparatus comprising: at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the first apparatus to: obtain transmission property information of a link between the first apparatus and a second apparatus based on a measurement metric on the link; and obtain a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.

2. The first apparatus of claim 1, wherein the first apparatus is caused to: skip applying the channel coding to the data set based on the result.

3. The first apparatus of claim 2, wherein the result indicates not to apply the channel coding based on a determination that a target symbol error probability obtained based on themeasurement metric and the transmission property information matches a reference symbolerror probability.

4. The first apparatus of claim 1, wherein the first apparatus is caused to: applying the channel coding to the data set based on the result.

5. The first apparatus of claim 4, wherein the result indicates applying the channel coding based on a determination that a target symbol error probability obtained based on themeasurement metric and the transmission property information does not match a referencesymbol error probability.

6. The first apparatus of any of claims 1-3, wherein the first apparatus is caused to: based on a determination that the channel coding is not applied to the data set, transmit, to the second apparatus, a first indication indicating that no channel coding is applied to the data set.

7. The first apparatus of any of claims 1-6, wherein the first apparatus is caused to:NC333554 receive, from the second apparatus, a second indication for a counting query over data at the first apparatus.

8. The first apparatus of any of claims 1-7, wherein the first apparatus is caused to: determine the data set by performing the counting query on the data.

9. The first apparatus of any of claims 1-8, wherein the first apparatus is caused to: transmit, to the second apparatus, a third indication indicating a usage of a type of private data transfer.

10. The first apparatus of any of claims 1-9, wherein the first apparatus is caused to: receive, from the second apparatus, one or more reference signals on the link; perform a measurement on the one or more reference signals; and obtain the measurement metric by determining a Signal to Interference plus Noise Ratio (SINR) on the link based on the measurement.

11. The first apparatus of any of claims 1-10, wherein the first apparatus is caused to: obtain a symbol error probability for transmitting the data set based on a privacy parameter required by the data set and the number of outputs of the counting query.

12. The first apparatus of claim 11, wherein the first apparatus is caused to: minimize the symbol error probability for transmitting the data set by adjusting the measurement metric.

13. The first apparatus of claim 11, wherein the first apparatus is caused to: minimize the symbol error probability for transmitting the data set by applying the channel coding to the data set.

14. The first apparatus of any of claims 1-13, wherein the transmission property information is a probability transition matrix related to the link.

15. The first apparatus of any of claims 1-14, wherein the first apparatus is a terminal device and the second apparatus is a network device.NC333554 16. A second apparatus comprising: at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the second apparatus to: receive, from a first apparatus, a first indication indicating that no channel coding is applied to a data set; receive the data set from the first apparatus; and decode the data set based on the first indication.

17. The second apparatus of claim 16, wherein the second apparatus is caused to: skip channel decoding on the data set based on the first indication.

18. The second apparatus of any of claims 16-17, wherein the second apparatus is caused to: transmit, to the first apparatus, a second indication for a counting query over data at the first apparatus.

19. The second apparatus of any of claims 16-18, wherein the first second is caused to: receive, from the first apparatus, a third indication indicating a usage of a type of private data transfer.

20. The second apparatus of any of claims 16-19, wherein the first apparatus is aterminal device and the second apparatus is a network device.

21. A method comprising:obtaining, at a first apparatus, transmission property information of a link betweenthe first apparatus and a second apparatus based on a measurement metric on the link; and obtaining a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.NC333554 22. A method comprising: receiving, at a second apparatus and from a first apparatus, a first indicationindicating that no channel coding is applied to a data set; receiving the data set from the first apparatus; anddecoding the data set based on the first indication.23.A first apparatus comprising: means for obtaining transmission property information of a link between the first apparatus and a second apparatus based on a measurement metric on the link; and means for obtaining a result associated with a channel coding to a data set used for transmitting to the second apparatus on the link, based on the transmission property information.

24. A second apparatus comprising: means for receiving, from a first apparatus, a first indication indicating that nochannel coding is applied to a data set; means for receiving the data set from the first apparatus; andmeans for decoding the data set based on the first indication.

25. A computer readable medium comprising instructions stored thereon forcausing an apparatus at least to perform the method of claim 21 or 22.

Images