Abstract: An apparatus for authorizing file access events includes a processor and a memory that stores code executable by the processor. The code is executable by the processor to record hardware usage patterns prior to a file access event of a file, and correlate the hardware usage patterns with file access events targeting the file. The code is also executable to receive a file access event targeting the file, compare a hardware usage pattern preceding the received file access event targeting the file to the hardware usage patterns correlated with file access events targeting the file, and authorize the received file access event in response to the hardware usage pattern preceding the received file access event targeting the file matching a hardware usage pattern correlated to a file access event targeting the file.

Abstract: A source device being associated with an account uses playback of a media content item to cause a target device to become associated with the account. The target device enters an association mode and records a portion of the playing content. The target device provides the recording to a server that identifies the song (e.g., using a music fingerprint service) and uses the identification of the song to find the account that caused playback of the identified song. With the account identified, the server provides credentials of the account to target system. The target device accesses content or services using the account. As confirmation of receiving the credentials, the server causes playback of the content to transition to from the source device to the target device.

Abstract: A method for performing a secure comparison between a first secret data and a second secret data, including: receiving, by a processor of a first party, encrypted bits of the second secret data y from a second party, where is an integer; computing the Hamming weight h of first secret data x, wherein x has bits; computing the value of a first comparison bit ?A such that ?A=0 when h>?/2?, ?A=1 when h<?/2?, and ?A is randomly selected when h=/2; forming a set of ?/2? indexes that includes at least the indexes i where xi=?A; selecting random invertible scalars ri for each i in and computing c*i=(1+(1?2?A)xi·yi2?A?1·(xj?yj))ri wherein w denotes the homomorphic encryption of w using a cryptographic key of the second party; selecting random invertible scalars r?1 and computing c*?1=(?A·xj?yj)r?1; transmitting ciphertexts c*i in a random order to the second party.