PRIVACY PROTECTION MECHANISMS FOR CONNECTED VEHICLES

    公开(公告)号:US20200162901A1

    公开(公告)日:2020-05-21

    申请号:US16707544

    申请日:2019-12-09

    Abstract: Various embodiments are generally directed to techniques for providing improved privacy protection against vehicle tracking for connected vehicles of a vehicular network. For example, at least one road side unit may: identify a set of vehicles that require pseudonym changes and send an invitation for a pseudonym change event to each of the vehicles, determine at least a total number of the acceptances, determine whether the total number meets or exceeds a predetermined threshold number, send acknowledgement messages to the accepting vehicles if the threshold number is met, and form a vehicle group to coordinate the pseudonym change event during a privacy period. During the privacy period, the RSU and the vehicles may communicate with each other in a confidential and private manner via key-session-based unicast transmission, and coordinate transmission power and vehicle trajectory adjustments to maximize the benefits for safety and obfuscation for privacy.

    EFFICIENT POST-QUANTUM ANONYMOUS ATTESTATION WITH SIGNATURE-BASED JOIN PROTOCOL AND UNLIMITED SIGNATURES

    公开(公告)号:US20220239498A1

    公开(公告)日:2022-07-28

    申请号:US17721656

    申请日:2022-04-15

    Abstract: In one example an apparatus comprises a computer readable memory; and a signature module to generate a set of cryptographic keys for attestation of group member devices and a set of leaf nodes in a sub-tree of a Merkle tree corresponding to the set of cryptographic keys, forward the set of leaf nodes to a group manager device, receive, from the group manager device, a subset of intermediate nodes in the Merkle tree, the intermediate nodes being common to all available authentications paths through the Merkel tree for signatures originating in the sub-tree, and determine a cryptographic key that defines an authentication path through the Merkle tree, the authentication path comprising one or more nodes from the set of leaf nodes and one or more nodes from the intermediate nodes received from the group manager device. Other examples may be described.

    ODD INDEX PRECOMPUTATION FOR AUTHENTICATION PATH COMPUTATION

    公开(公告)号:US20190319803A1

    公开(公告)日:2019-10-17

    申请号:US16456064

    申请日:2019-06-28

    Abstract: In one example an apparatus comprises a computer-readable memory, signature logic to compute a message hash of an input message using a secure hash algorithm, process the message hash to generate an array of secret key components for the input message, apply a hash chain function to the array of secret key components to generate an array of signature components, the hash chain function comprising a series of even-index hash chains and a series of odd-index hash chains, wherein the even-index hash chains and the odd-index hash chains generate a plurality of intermediate node values and a one-time public key component between the secret key components and the signature components and store at least some of the intermediate node values in the computer-readable memory for use in one or more subsequent signature operations. Other examples may be described.

    EFFICIENT LOW-OVERHEAD SIDE-CHANNEL PROTECTION FOR POLYNOMIAL MULTIPLICATION IN POST-QUANTUM ENCRYPTION

    公开(公告)号:US20240031140A1

    公开(公告)日:2024-01-25

    申请号:US17814448

    申请日:2022-07-22

    CPC classification number: H04L9/0858 H04L9/3093 H04L9/0869

    Abstract: In one example an apparatus comprises a first input node to receive a first input, a second input node to receive a control signal, a polynomial multiplication circuitry to perform a polynomial multiplication operation using the first input in a security mode determined by the control signal, the security mode comprising one of a first mode in which no side-channel protection is provided to the polynomial multiplication operation, a second mode in which a shuffling-based side-channel protection is provided to the polynomial multiplication operation, a third mode in which a masking or splitting side-channel protection is provided to the polynomial multiplication operation, or a fourth mode in which a masking and shuffling based side-channel protection is provided to the polynomial multiplication operation. Other examples may be described.

Patent Agency Ranking