Abstract: A method may include obtaining policy information and a public key from a first trusted authority regarding an attribute of users to be verified, and generating a challenge query based on the public key, the policy information, and a verifier random value. The method may also include sending the challenge query to a user to verify the attribute of the user. The method may additionally include receiving a response from the user that is responsive to the challenge query, where the response is based on the challenge query and a user-specific secret key obtained by the user from a second trusted authority, and the user-specific secret key is generated by the trusted authority based on a general secret key corresponding to the public key and the attribute of the user. The method may also include verifying the attribute of the user based on the response.

Abstract: Embodiments include a package structure with one or more layers of dielectric material, where an interconnect bridge substrate is embedded within the dielectric material. One or more via structures are on a first surface of the embedded substrate, where individual ones of the via structures comprise a conductive material and have a tapered profile. The conductive material is also on a sidewall of the embedded substrate.

Abstract: A validation system includes a plurality of validator devices. Each of the plurality of validator devices is assigned with a group signature. The validation system receives a cross-blockchain transaction from a plurality of transaction participant devices. The cross-blockchain transaction is associated with a plurality of blockchains. The validation system further controls a first validator device of the plurality of validator devices to apply an extended smart contract on the received cross-blockchain transaction. Further, the validation system validates the application of the extended smart contract on the cross-blockchain transaction based on the group signature assigned to each of the plurality of validator devices, to generate a transaction validation result. Further, the validation system transmits the generated transaction validation result, associated with the validation of the cross-blockchain transaction, to the plurality of blockchains.

Abstract: A method may include obtaining a first matrix that represents data in a data set and obtaining a number of clusters into which the data is to be grouped. The method may further include constructing a second matrix using the first matrix and the number of clusters. The second matrix may represent a formulation of a first optimization problem in a framework of a second optimization problem. The method may further include solving the second optimization problem using the second matrix to generate a solution of the second optimization problem and mapping the solution of the second optimization problem into a first solution matrix that represents a solution of the first optimization problem. The method may further include grouping the data into multiple data clusters using the first solution matrix. A number of the multiple data clusters may be equal to the number of clusters.

Abstract: According to an aspect of an embodiment, operations include receiving a layout of a maritime facility and a first input including a vehicle count associated with a fleet of transport vehicles on the maritime facility. The operations further include determining a weighted graph representation of the maritime facility based on the received layout and generating a Quadratic Unconstrained Binary Optimization (QUBO) formulation based on the weighted graph representation and the received first input. The operations further include submitting the generated QUBO formulation to a first optimization solver machine and receiving a first solution of the submitted QUBO formulation. The operations further include determining a set of paths to be traversed by the fleet of transport vehicles on the maritime facility for transporting the plurality of shipping containers to respective destination locations based on the received first solution.

Abstract: A method may include obtaining a secret key, a user device secret key, and a server secret key based on the secret key and the user device secret key. The method may include dividing the user device secret key into a plurality of user device shares and the server secret key into a plurality of server shares. The method may include distributing the plurality of user device shares to a plurality of user devices and the plurality of server shares to a plurality of service providers. The method may include obtaining a public key based on the secret key. The method may also include publishing the public key. The method may include obtaining a recovery authority secret key and a recovery vault secret key such that a user may recover an account if the user devices and/or the service providers are compromised.

Abstract: A method of participation verification includes generating sets of cryptocurrency coins (coin sets). The coin sets have cryptocurrency coins and correlate to events for which participation is verified. The method includes generating user keys including unique public keys for each user and user secret keys. The method includes assigning a public key to a user, communicating the assigned public key to a user device and enabling download of a verification application. The method includes receiving a first coin request that includes identification of a first coin set, the assigned public key, and a data set. The method includes verifying user participation in an event based on the data set. The method includes executing a cryptocurrency transaction with the user device. The cryptocurrency transaction including public validation of a transfer of a cryptocurrency coin from the identified coin set to the user device via an append-only ledger.

Abstract: A method may include receiving, from a first trusted authority (which may be distributed), a secret key specific to a party for use in posting to a blockchain. The method may also include receiving, from a second trusted authority (which may be distributed), a correlated randomness component specific to the party and associated with a given temporal segment; and computing, using an input from the party and the correlated randomness component in a non-interactive multi-party computation (NIMPC), an NIMPC-encrypted input associated with the party for the given temporal segment. The method may also include encrypting the NIMPC-encrypted input according to a blockchain encryption algorithm to yield a ciphertext, and submitting the ciphertext to a block associated with the given temporal segment in a blockchain, the block able to be decrypted after a future block of the blockchain is posted after the block is posted to the blockchain.

Abstract: Systems, methods, and instrumentalities are disclosed for Random Access Channel (RACH) procedures in unlicensed spectrum. A wireless transmit/receive unit (WTRU) may monitor for a random access response (RAR) or a reference signal (RS), e.g. in an RAR window. The WTRU may determine whether an RS has been received a threshold amount of times, e.g. if an RAR is not received. The WTRU may continue to monitor for an RAR or an RS, e.g. if the RS has not been received a threshold amount of times and the RAR window is not at a maximum RAR window size.

Abstract: According to an aspect of an embodiment, operations include receiving a Quadratic Integer Programming (QIP) problem including an objective function and a set of constraints on integer variables associated with the objective function. The operations further include obtaining an approximation of the QIP problem by relaxing the QIP problem and generating an approximate solution by solving the obtained approximation. The operations further include generating a Quadratic Unconstrained Binary Optimization (QUBO) formulation of the QIP problem based on the generated approximate solution and the received QIP problem. The operations further include submitting the generated QUBO formulation to an optimization solver machine and receiving a solution of the submitted QUBO formulation from the optimization solver machine. The operations further include publishing an integral solution of the received QIP problem on a user device based on the received solution.

Abstract: An apparatus includes a global memory and a systolic array. The global memory is configured to store and provide an input feature map (IFM) vector stream from an IFM tensor and a kernel vector stream from a kernel tensor. The systolic array is configured to receive the IFM vector stream and the kernel vector stream from the global memory. The systolic array is on-chip together with the global memory. The systolic array includes a plurality of processing elements (PEs) each having a plurality of vector units, each of the plurality of vector units being configured to perform a dot-product operation on at least one IFM vector of the IFM vector stream and at least one kernel vector of the kernel vector stream per unit clock cycle to generate a plurality of output feature maps (OFMs).

Abstract: Systems, devices, and methods for operating in an unlicensed band are disclosed herein. In one example, a device may receive configuration information that includes a maximum channel occupancy time (MCOT) and a plurality of parameters including a plurality of transmission opportunity windows (TOWs). Based on the configuration information, the device may split a transmission into a plurality of bursts that may be grouped into sets of bursts based on how many bursts fit within a TOW. The number of bursts in a set of bursts may be less than or equal to the MCOT. The device may perform a clear channel assessment (CCA) to determine if the channel is busy and to determine a start time within the TOW for the bursts. The device may then transmit the set of bursts for that TOW, where each burst may have a burst indicator (BI).

Abstract: According to some examples, computer-implemented methods to detect a potential privacy violation as a result of a release of a database are described. An example computer-implemented method may include anonymizing a database and calculating a measure of entropy resulting from a release of the anonymized database without releasing the anonymized database. The method may also include determining whether the calculated measure of entropy satisfies a privacy threshold and, responsive to a determination that the calculated measure of entropy satisfies the privacy threshold, releasing the anonymized database. The method may further include, responsive to a determination that the calculated measure of entropy does not satisfy the privacy threshold, not allowing the release of the anonymized database.

Abstract: A method of transmitting a message via a blockchain network is provided. A method may include encrypting, via a first identity-based encryption (IBE) function, a message to generate a ciphertext. The method may further include transmitting the ciphertext to each node of a plurality of nodes in a blockchain network. Further, the method may include decrypting, via a second IBE function, the ciphertext at each node of the plurality of nodes in the blockchain network after at least one condition is met.

Abstract: A method may include obtaining a set of multivariate quadratic polynomials associated with a multivariate quadratic problem and generating an Ising Model connection weight matrix “W” and an Ising Model bias vector “b” based on the multivariate quadratic polynomials. The method may also include providing the matrix “W” and the vector “b” to an annealing system configured to solve problems written according to the Ising Model and obtaining an output from the annealing system that represents a set of integers. The method may also include using the set of integers as a solution to the multivariate quadratic problem.

Abstract: A method may include assigning each node of a first network to a different node cluster such that a number of nodes equals a number of node clusters, selecting multiple nodes of the first network as a set of nodes, and selecting multiple node clusters as a set of node clusters. The method may also include solving a first optimization problem by reassigning one or more of the nodes of the set of nodes to different node clusters of the set of node clusters while maintaining assigned node clusters of the nodes that are not part of the set of nodes and after reassigning one or more of the nodes of the set of nodes to different node clusters, merging the nodes assigned to at least one of the node clusters to form a second network with fewer nodes than the number of nodes of the first network.

Abstract: Techniques and mechanisms for providing anisotropic etching of a metallization layer of a substrate. In an embodiment, the metallization layer includes grains of a conductor, wherein a first average grain size and a second average grain size correspond, respectively, to a first sub-layer and a second sub-layer of the metallization layer. The first sub-layer and the second sub-layer each span at least 5% of a thickness of the metallization layer. A difference between the first average grain size and the second average grain size is at least 10% of the first average grain size. In another embodiment, a first condition of metallization processing contributes to grains of the first sub-layer being relatively large, wherein an alternative condition of metallization processing contributes to grains of the second sub-layer being relatively small. A grain size gradient across a thickness of the metallization layer facilitates etching processes being anisotropic.

Abstract: Methods and apparatuses are described herein that facilitate mesh network communication by a millimeter wave base stations (mBs) or WTRUs as nodes of a directional mesh network with other nodes of the directional mesh network. The mB or WTRU may include a directional antenna configured to transmit and receive signals in specific directions during the mesh network communication to define a directional mesh network. The mBs or WTRUs may transmit transmission request messages to neighbor nodes, wherein the transmission request messages include transmission slot allocation bitmaps and channel quality indicator information (CQI). Then response messages from the neighbor nodes may be received, wherein the response messages include receive slot allocation bitmaps and resource allocation decisions. The mBs or WTRUs may then update their transmission slot allocation bitmaps based on the received response messages and transmit data packets in specific directions based on the updated transmission slot allocation bitmap.

Abstract: Techniques and mechanisms for providing anisotropic etching of a metallization layer of a substrate. In an embodiment, the metallization layer includes grains of a conductor, wherein a first average grain size and a second average grain size correspond, respectively, to a first sub-layer and a second sub-layer of the metallization layer. The first sub-layer and the second sub-layer each span at least 5% of a thickness of the metallization layer. A difference between the first average grain size and the second average grain size is at least 10% of the first average grain size. In another embodiment, a first condition of metallization processing contributes to grains of the first sub-layer being relatively large, wherein an alternative condition of metallization processing contributes to grains of the second sub-layer being relatively small. A grain size gradient across a thickness of the metallization layer facilitates etching processes being anisotropic.

Abstract: Latency reduction by fast forward (FF) in multi-hop communication device and/or systems is disclosed. Packets may be received and forwarded using a codeword (CW)-based approach with and/or without per-CW CRC. A FF session may have a flow ID and packets may have sequence numbers. Packets targeted for FF may be divided into independently decodable CWs that may be transmitted in the next hop, for example, as soon as the destination is determined without waiting for an entire packet's arrival and/or for CRC verification. Low latency (e.g. FF) traffic may be indicated. CW-based FF may be extensible for an e2e RAN path from a WTRU to the last access node in a RAN. Intermediate metrics, a packet CRC and/or a per-CW CRC may be utilized for data integrity. HARQ and/or CW retransmission procedures may be implemented between network nodes for error handling.