Yeda Research and Development Co. Ltd.

Yeda Research and Development Co. Ltd. at the Weizmann Institute of

Massachusetts Institute of Technology

Other

B.g. Negev Technologies and Applications Ltd.

Sami Shamoon College of Engineering

Shlomi Dolev

Adi Shamir

Yossi Matias

Ronald L Rivest

Yuval Elovici

Ben Nassi

Marina Kopeetsky

Amos Fiat

Leonard M Adleman

A system and method for identifying if a drone is illegitimately video streaming a location, object or person. An interceptor intercepts radio transmissions and identifies if a radio transmission is an FPV video transmission. A watermarker is used for emitting a periodic physical stimulus at a given frequency for a given duration. The system then verifies if there is a correlation between the video transmission and the periodic physical stimulus; and issues a privacy invasion attack notification if such a correlation is determined between the video transmission and the periodic physical stimulus.

Analyzing radio transmission for detecting whether a drone is filming a point of interest

Method and apparatus for protecting RFID tags against power attacks by embedding two capacitors in an RFID tag and coupling to the RFID power extraction and computational circuitry to be operated so that at any given time during normal operation of the RFID tag one of them is coupled to the power extraction circuitry of the RFID tag and is storing energy that is being generated by the charge pump of the tag by sucking energy from the electromagnetic or magnetic field of a tag reader, and the other one is uncoupled from the power extraction circuitry of the RFID tag and is discharging and powering the computational element of the tag chip.

Method and apparatus for protecting RFID tags from power analysis

A method and apparatus for repeated communication sessions between a sender (e.g., RFID tag) and a receiver (RFID reader) that employs a proactive information security scheme is based on the assumption that the information exchanged during at least one of every n successive communication sessions is not exposed to an adversary. The sender and the receiver maintain a vector of n entries that is repeatedly refreshed by pairwise XORING entries, with a new vector of n entries that is randomly chosen by the sender and sent to the receiver as a part of each communication session. Also, a computational secure scheme based on the information secure scheme is employed to ensure that even in the case that the adversary listens to all the information exchanges, the communication between the sender and the receiver is secure. In particular, the scheme can be used in the domain of remote controls (e.g., for cars).

Method, apparatus and product for RFID authentication

A method and apparatus for implementing a novel one-way hash function with provable security properties for authentication and non-authentication applications on highly constrained devices, with particular application to RFID tags.

Method and apparatus for implementing a novel one-way hash function on highly constrained devices such as RFID tags

A method and apparatus for factoring large numbers which utilizes an optoelectronic device that has a wafer at one end that contains a plurality of LEDs. Each LED is associated with at least one period p and at least one delay d . A clock drives the plurality of LEDs responsive to clock cycles to flash for one clock cycle at times described by the processing p &bull;r&plus;d for r&gE;0. The light intensity flashed by the LEDs is controlled by a filter to be proportional to log (p ), and a photodetector positioned at the other end of the cylinder collects the light flashed by the LEDs.

Method and apparatus for factoring large numbers with optoelectronic devices

A method and apparatus for protecting smart cards against simple and differential power attacks when they are inserted into card readers controlled by other entities. The technique is particularly useful in financial applications such as ATM cards, credit cards, and electronic wallets, in which cards have to be inserted into card readers which may be specifically manufactured or modified to perform undetectable measurements of the power supplied to the card during its normal operation. The basic technique is to use two capacitors embedded in the smart card in such a way that at any given time one of them is charged by the external power supply and the other one is discharged by powering the smart card chip. The roles of the two capacitors alternate rapidly, and the power supply is detached from the smart card chip in the sense that external power measurements do not reveal information about its internal operations.

Protecting smart cards from power analysis with detachable power supplies

A well-known technique to discourage piracy of digital objects is to fingerprint the version each customer receives. The invention provides a novel way of fingerprinting the decryption functions given by broadcasters to their customers (usually in the form of smart cards). The main difficulty is to ensure that all the algorithms provided by the broadcaster implement the same decryption function, and yet to make it computationally difficult for a pirate who obtains a large number of such implementations to find even one fundamentally different implementation which is not traceable to a particular customer.

Method of protecting broadcast data by fingerprinting a common

Improved methods and apparatus are provided for protecting public key schemes based on modular exponentiation (including RSA and Diffie-Hellman) from indirect cryptanalytic techniques such as timing and fault attacks. Known methods for making the implementation of number-theoretic schemes resistant to such attacks typically double their running time, whereas the novel methods and apparatus described in this patent add only negligible overhead. This improvement is particularly significant in smart card and software-based implementations, in which the modular exponentiation operation is quite slow, and doubling its time may be an unacceptable solution.

Method and apparatus for protecting public key schemes from timing and

Memory efficient variants of public key encryption and identification schemes for smart card applications with severely limited RAM without using dedicated coprocessors. The variants replace the memory-intensive modular multiplication operation z=x*y (mod n) by a new randomized multiplication operation z'=x*y+r*n, where r is a randomly chosen integer in a suitable range 0,b!, and a double convolution process to compute z' is used. Method and apparatus are described.

Method and apparatus for memory efficient variants of public key

A method and device for protecting visual information against unauthorized access and modification using a printed cryptographic watermark includes printing a first array of shapes on a first sheet of material to be protected and printing a second array of shapes on a second sheet of material, which is transparent so as to form a developer for developing a watermark encoded in a combination of the first and second arrays of shapes. The watermark is encoded by preparing each array using black and white pixels. Each pixel, which may be a square, rectangle, circle, hexagon or other shape, is split into first and second collections of subpixels, the first collection of subpixels appearing in the first array of shapes and the second collection of subpixels appearing in the second array of shapes. When the transparent second sheet of material is positioned directly on top of the first sheet of material with the second array of shapes aligned with the first array of shapes, the first sheet of material may be viewed through the transparent second sheet of material. In this manner, the encoded watermark, which was not visible in either one the two individually, becomes visible. Additionally, a first image may be encoded in the first sheet, a second image may be encoded in the second sheet, and the watermark may be viewed as a third image that is visible in the combination of the first and second sheets.

Method and apparatus for protecting visual information with printed

A birational permutation is a function f which is a one-to-one and onto mapping over k-tuples of numbers, where both f and its inverse are low degree rational functions. This patent describes a novel digital signature scheme which is based on a new class of birational permutations which have small keys and require few arithmetic operations.

Efficient signature scheme based on birational permutations

A new type of digital signature scheme whose security is based on the difficulty of solving systems of k polynomial equations in m unknowns modulo a composite n is proposed. The scheme uses a simple technique (called sequential linearization) for embedding trapdoors into such systems of equations.

Fast signature scheme based on sequentially linearized equations

A method of encrypting a video signal employing a pseudorandom Space Filling Curve having a highly irregular scanning pattern for scanning the pixel addresses of a video picture stored in a frame buffer. The method is used with a video scrambler/descrambler device and is characterized by a much higher cryptographic strength than existing techniques, which is not subject to simple correlation attacks by comparing and matching of line portions. In addition, the method features a reduction in the video signal bandwidth for typical pictures.

Video scrambling apparatus and method based on space filling curves

A method and apparatus are disclosed and claimed which enable an entity to generate proofs of identity and signatures of messages that everyone can verify but no one can forge. Compared to other schemes of this type (such as the RSA), the Fiat-Shamir scheme is faster by one to two orders of magnitude. In the present invention disclosed and claimed in this patent application, two improved variants of the Fiat-Shamir scheme are described which are even faster. One variant uses small public values to optimize the vertification procedure, and the other variant uses particular secret values to optimize the generation procedure.

Variants of the fiat-shamir identification and signature scheme

A method and apparatus for identification of a prover to a verifier in which the prover demonstrates his knowledge of a secret permutation .pi. such that V.sub..pi. .epsilon. K(A) for publicly known A and V where all the arithmetic operations are carried out modulo p. The actual proof does not reveal any knowledge of .pi., and thus it cannot be misused by dishonest verifiers or eavesdroppers to later misrepresent themselves as the prover. The new scheme is much faster than the RSA and Fiat-Shamir identification schemes.

Growing community of inventors

Rehovot, Israel

Adi Shamir