-
公开(公告)号：US20240205018A1
公开(公告)日：2024-06-20
申请号：US18081225
申请日：2022-12-14
Applicant: SAP SE
Inventor： Anitha Naduvath , Bino Rose Philip , Anselme Tueno , Andrey Hoursanov , Tim Rausch , David Boehm , Ajitha Naduvath , Mohamed Doula
CPC classification number: H04L9/3247 , G06F16/93
Abstract: Mechanisms are disclosed for decoupled integration of quantum-safe digital signatures into software applications. Electronic document content is stored, by a software application, in connection with a document store. An application programming interface (API) request is issued to a quantum-safe digital signature service. The API request comprises an identifier associated with the electronic document content and a request to generate a quantum-safe signature associated with the electronic document content. The request to generate a quantum-safe signature of the electronic document content causes the quantum-safe digital signature service to perform several steps. First, the electronic document content is retrieved from the document store. Next, a quantum-safe digital signature data structure is generated. Next, the quantum-safe digital signature data structure is stored to the document store. A signing status update is transmitted to the software application. The software application reads the signature data structure from the document store.
-
公开(公告)号：US20230379135A1
公开(公告)日：2023-11-23
申请号：US18221665
申请日：2023-07-13
Applicant: SAP SE
Inventor： Anselme Tueno , Yordan Boev , Florian Kerschbaum
IPC: H04L9/00 , G06N20/10 , G06F40/126 , G06F40/205 , H04L9/06 , G06N5/01
CPC classification number: H04L9/008 , G06N20/10 , G06F40/126 , G06F40/205 , H04L9/0618 , G06N5/01 , H04L2209/08
Abstract: A non-interactive protocol is provided for evaluating machine learning models such as decision trees. A client can delegate the evaluation of a machine learning model such as a decision tree to a server by sending an encrypted input and receiving only the encryption of the result. The inputs can be encoded as vector of integers using their binary representation. The server can then evaluate the machine learning model using a homomorphic arithmetic circuit. The homomorphic arithmetic circuit provides an implementation that requires fewer multiplication than a Boolean comparison circuit. Efficient data representations are then combined with different algorithmic optimizations to keep the computational overhead and the communication cost low. Related apparatus, systems, techniques and articles are also described.
-
公开(公告)号：US12250292B2
公开(公告)日：2025-03-11
申请号：US17752326
申请日：2022-05-24
Applicant: SAP SE
Inventor： Anselme Tueno , Jonas Janneck
Abstract: In an example embodiment, a protocol for private set intersection is introduced that provides for two-party computation. Each party has a private data set and both parties want to securely compute the intersection of their sets, such that only the result is revealed and nothing else. Construction rules are provided that rely on the evaluation of a branching program (BP) using a fully homomorphic encryption (FHE) scheme. Using the properties of an FHE scheme, a non-interactive protocol is built with extendable functionalities. Thus, not only can the intersection be securely computed but the result can be used for further secure computations. Furthermore, the communication overhead for practical applications is independent of the server's set size, allowing for easy scalability.
-
Patent Agency Ranking
公开(公告)号：US12155754B2
公开(公告)日：2024-11-26
申请号：US17525372
申请日：2021-11-12
Applicant: SAP SE
Inventor： Anselme Tueno , Jonas Janneck
Abstract: Systems, methods, and computer-readable media are disclosed for secure integer comparison using binary trees. A server may receive a first encrypted input and a public encryption key from a client. The server may create a binary tree representing a second encrypted input. The server may evaluate the first encrypted input on the binary tree. The evaluation may comprise computing decision bits along a plurality of paths of the binary tree. The decision bits may then be aggregated along each path of the binary tree and the aggregation stored at a leaf node of each path. The leaf node of each path may be evaluated to obtain a comparison result. The comparison result may be encrypted with the public encryption key. The server may send the comparison result to the client for decryption. The comparison result may indicate whether the first input was larger than the second input.
-
公开(公告)号：US12069156B2
公开(公告)日：2024-08-20
申请号：US18221665
申请日：2023-07-13
Applicant: SAP SE
Inventor： Anselme Tueno , Yordan Boev , Florian Kerschbaum
IPC: H04L9/00 , G06F40/126 , G06F40/205 , G06N5/01 , G06N20/00 , G06N20/10 , H04L9/06
CPC classification number: H04L9/008 , G06F40/126 , G06F40/205 , G06N5/01 , G06N20/10 , H04L9/0618 , H04L2209/08
Abstract: A non-interactive protocol is provided for evaluating machine learning models such as decision trees. A client can delegate the evaluation of a machine learning model such as a decision tree to a server by sending an encrypted input and receiving only the encryption of the result. The inputs can be encoded as vector of integers using their binary representation. The server can then evaluate the machine learning model using a homomorphic arithmetic circuit. The homomorphic arithmetic circuit provides an implementation that requires fewer multiplication than a Boolean comparison circuit. Efficient data representations are then combined with different algorithmic optimizations to keep the computational overhead and the communication cost low. Related apparatus, systems, techniques and articles are also described.
-
公开(公告)号：US20240205015A1
公开(公告)日：2024-06-20
申请号：US18069017
申请日：2022-12-20
Applicant: SAP SE
Inventor： Joern Kussmaul , Anselme Tueno
CPC classification number: H04L9/3239 , G06F16/2255 , H04L9/008
Abstract: Mechanisms are disclosed for providing an extended private set intersection nested cuckoo hashing scheme for secure computation of private set intersections. A set of outer hash functions and a set of inner hash functions are exchanged between a server and a client. A server outer hash table is populated using an outer hash function in the set of outer hash functions and the set of server items to create a set of server bins. For each server bin in the server outer hash table, server items to be inserted are iteratively placed into a server inner cuckoo hash table using a plurality of inner hash functions corresponding to each server bin, based on determining that a first corresponding hash table position is free.
-
公开(公告)号：US20230388102A1
公开(公告)日：2023-11-30
申请号：US17752326
申请日：2022-05-24
Applicant: SAP SE
Inventor： Anselme Tueno , Jonas Janneck
Abstract: In an example embodiment, a protocol for private set intersection is introduced that provides for two-party computation. Each party has a private data set and both parties want to securely compute the intersection of their sets, such that only the result is revealed and nothing else. Construction rules are provided that rely on the evaluation of a branching program (BP) using a fully homomorphic encryption (FHE) scheme. Using the properties of an FHR scheme, a non-interactive protocol is built with extendable functionalities. Thus, not only can the intersection be securely computed but the result can be used for further secure computations. Furthermore, the communication overhead for practical applications is independent of the server's set size, allowing for easy scalability.
-
公开(公告)号：US20230155815A1
公开(公告)日：2023-05-18
申请号：US17525372
申请日：2021-11-12
Applicant: SAP SE
Inventor： Anselme Tueno , Jonas Janneck
CPC classification number: H04L9/0836 , H04L9/0825 , H04L9/0662 , H04L9/008
Abstract: Systems, methods, and computer-readable media are disclosed for secure integer comparison using binary trees. A server may receive a first encrypted input and a public encryption key from a client. The server may create a binary tree representing a second encrypted input. The server may evaluate the first encrypted input on the binary tree. The evaluation may comprise computing decision bits along a plurality of paths of the binary tree. The decision bits may then be aggregated along each path of the binary tree and the aggregation stored at a leaf node of each path. The leaf node of each path may be evaluated to obtain a comparison result. The comparison result may be encrypted with the public encryption key. The server may send the comparison result to the client for decryption. The comparison result may indicate whether the first input was larger than the second input.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.013 seconds)
