Search Patents
  • METHODS, SYSTEMS, AND COMPUTER READABLE MEDIA FOR DETECTING COVERT TIMING CHANNELS
    Publication number: 20170213028
    Abstract: A mechanism called time-deterministic replay (TOR) that can reproduce the execution of a program, including its precise timing. Without TOR, reproducing the timing of an execution is difficult because there are many sources of timing variability. TOR uses a combination of techniques to either mitigate or eliminate most of these sources of variability. Using a prototype implementation of TOR in a Java Virtual Machine, we show it is possible to reproduce the timing to within 1.85% of the original execution. A study of one of the applications of TOR is described: the detection of a covert timing channel. Timing channels can be used to exfiltrate information from a compromised machine by subtly varying timing of the machine's outputs, TOR can detect this variation. Unlike prior solutions, which generally look for a specific type of timing channel, our approach can detect a wide variety of channels with high accuracy.
    Type: Application
    Filed: October 5, 2015
    Publication date: July 27, 2017
    Inventors: Ang Chen, Hanjun Xiao, William Bradley Moore, Andreas Haeberlen, Linh Thi Xuan Phan, Micah Sherr, Wenchao Zhou
  • DYNAMIC ADAPTION OF ARW MANAGEMENT WITH ENHANCED SECURITY
    Publication number: 20220201020
    Abstract: Methods and apparatus for dynamic adaption of anti-replay window (ARW) management with enhanced security. According to aspects of the method, pre-ARW block employing a pre-ARW sliding window and an ARW block employing an ARW sliding window are maintained for an associated IPsec security association (SA). A determination is made to whether a received packet passes a pre-ARW check using the pre-ARW sliding window. When it does, the pre-ARW sliding window is advanced, encrypted content in the packet is decrypted, and processing is forwarded to the ARW block which performs an ARW check and advances the ARW sliding window when the ARW check is passed. Packets that do not pass the pre-ARW check may be buffered in queues and subsequently rechecked against the ARW sliding window. Under solutions provided herein, ARW checks and updates are decoupled from the decryption processes, enabling decryption to be performed in parallel and/or offloaded to a hardware accelerator.
    Type: Application
    Filed: March 14, 2022
    Publication date: June 23, 2022
    Inventors: Ravikumar AIMANGALA NAGARAJA SETTY, Rajakumar CHIDAMBARAM, Balaji CHINTALAPALLE, Deepak KHANDELWAL, Joy DEVASSYKUTTY PULLOKARAN, Joseph Maria Jaison VINCENT SOLOMON
  • Method and Device for the Transfer of a Data Flow a Data Source to a Data Sink
    Publication number: 20090240848
    Abstract: In the transfer of AV data flows, especially in a network environment, a delayed transition from one operating mode to the other operating mode will be possible when changing the operating mode from e.g. normal replay to fast forward search. This is due to the fact that—in the transfer from data source to data sink different buffer memory stages must be passed before the transferred data finally come to decoding. When the request for changing the operating mode comes, the data already present in the buffer memories must first be processed before the actually requested new data come to be decoded. For the solution of the problem described, it is suggested according to the invention that—after the request of changing the operating mode—the undesirable data in the buffer memories are quickly eliminated through suitable measures so that the desired data can then be decoded faster. To do that, an identifier for the new operating mode is inserted in the data flow on the part of the data source device.
    Type: Application
    Filed: October 24, 2006
    Publication date: September 24, 2009
    Inventors: Ingo Huetter, Michael Weber
  • Methods, systems, and computer readable media for detecting covert timing channels
    Patent number: 10437993
    Abstract: A mechanism called time-deterministic replay (TOR) that can reproduce the execution of a program, including its precise timing. Without TOR, reproducing the timing of an execution is difficult because there are many sources of timing variability. TOR uses a combination of techniques to either mitigate or eliminate most of these sources of variability. Using a prototype implementation of TOR in a Java Virtual Machine, we show it is possible to reproduce the timing to within 1.85% of the original execution. A study of one of the applications of TOR is described: the detection of a covert timing channel. Timing channels can be used to exfiltrate information from a compromised machine by subtly varying timing of the machine's outputs, TOR can detect this variation. Unlike prior solutions, which generally look for a specific type of timing channel, our approach can detect a wide variety of channels with high accuracy.
    Type: Grant
    Filed: October 5, 2015
    Date of Patent: October 8, 2019
    Assignees: THE TRUSTEES OF THE UNIVERSITY OF PENNSYLVANIA, GEORGETOWN UNIVERSITY
    Inventors: Ang Chen, Hanjun Xiao, William Bradley Moore, Andreas Haeberlen, Linh Thi Xuan Phan, Micah Sherr, Wenchao Zhou
  • INTER-NETWORK OPERATION OF MULTIPLE LOCATION NETWORKS
    Publication number: 20090002238
    Abstract: The present invention discloses a system and method for allowing a position receiver to determine position solutions from positioning signals from a plurality of autonomous positioning networks, each of which is synchronized to a different timebase. Each of the plurality of autonomous networks comprises one or more positioning-unit device, which is a specialized transceiver capable of receiving and interpreting reference positioning signals from a reference transmitter, a position receiver, another positioning-unit device or all. At least one positioning-unit device within a first autonomous positioning network receives positioning signals from at least one positioning-unit device from a second adjacent autonomous positioning network and measures the timebase difference between the second network and the first network and subsequently calculates a timebase clock correction.
    Type: Application
    Filed: August 16, 2006
    Publication date: January 1, 2009
    Inventor: David Small
  • Method and devices for the transfer of a data flow from a data source to a data sink
    Patent number: 7984205
    Abstract: In the transfer of AV data flows, especially in a network environment, a delayed transition from one operating mode to the other operating mode will be possible when changing the operating mode from e.g. normal replay to fast forward search. This is due to the fact that—in the transfer from data source to data sink different buffer memory stages must be passed before the transferred data finally come to decoding. When the request for changing the operating mode comes, the data already present in the buffer memories must first be processed before the actually requested new data come to be decoded. For the solution of the problem described, it is suggested according to the invention that after the request of changing the operating mode the undesirable data in the buffer memories are quickly eliminated through suitable measures so that the desired data can then be decoded faster. To do that, an identifier for the new operating mode is inserted in the data flow on the part of the data source device.
    Type: Grant
    Filed: October 24, 2006
    Date of Patent: July 19, 2011
    Assignee: Thomson Licensing
    Inventors: Ingo Huetter, Michael Weber
  • GUARANTEED COMMIT OUTCOME IN A DISTRIBUTED TRANSACTION PROCESSING SYSTEM
    Publication number: 20170220621
    Abstract: Techniques are described for providing a guaranteed commit outcome for global transactions that are optimized by deferring the commit processing to a resource manager, such as a DBMS, using optimizations. The “Distributed Transaction Processing: The XA Specification” standard specification is ambiguous regarding commit outcomes for transactions managed by DBMS, resulting in wrong results for vendors implementing the standard. The techniques described provide a guaranteed commit outcome when using the optimizations, creating the opportunity for safe replay of global transactions when a communication error or timeout occurs between the transaction manager and the resource manager, and eliminating ambiguous transaction outcomes reaching applications and end users. Techniques described herein distinguished between global transactions in a session managed by a transaction manager, and those in the same session that are managed by the resource manager using the optimizations.
    Type: Application
    Filed: January 28, 2016
    Publication date: August 3, 2017
    Inventors: CAROL COLRAIN, STEFAN HEINRICH ROESCH, TODD J. LITTLE, PAUL PARKINSON
  • Inter-network operation of multiple location networks
    Patent number: 7474265
    Abstract: The present invention discloses a system and method for allowing a position receiver to determine position solutions from positioning signals from a plurality of autonomous positioning networks, each of which is synchronized to a different timebase. Each of the plurality of autonomous networks comprises one or more positioning-unit device, which is a specialized transceiver capable of receiving and interpreting reference positioning signals from a reference transmitter, a position receiver, another positioning-unit device or all. At least one positioning-unit device within a first autonomous positioning network receives positioning signals from at least one positioning-unit device from a second adjacent autonomous positioning network and measures the timebase difference between the second network and the first network and subsequently calculates a timebase clock correction.
    Type: Grant
    Filed: August 16, 2006
    Date of Patent: January 6, 2009
    Inventor: David Small
  • Guaranteed commit outcome in a distributed transaction processing system
    Patent number: 10339127
    Abstract: Techniques are described for providing a guaranteed commit outcome for global transactions that are optimized by deferring the commit processing to a resource manager, such as a DBMS, using optimizations. The “Distributed Transaction Processing: The XA Specification” standard specification is ambiguous regarding commit outcomes for transactions managed by DBMS, resulting in wrong results for vendors implementing the standard. The techniques described provide a guaranteed commit outcome when using the optimizations, creating the opportunity for safe replay of global transactions when a communication error or timeout occurs between the transaction manager and the resource manager, and eliminating ambiguous transaction outcomes reaching applications and end users. Techniques described herein distinguished between global transactions in a session managed by a transaction manager, and those in the same session that are managed by the resource manager using the optimizations.
    Type: Grant
    Filed: January 28, 2016
    Date of Patent: July 2, 2019
    Assignee: Oracle International Corporation
    Inventors: Carol Colrain, Stefan Heinrich Roesch, Todd J. Little, Paul Parkinson
Narrow Results

Filter by US Classification