搜索结果: 1-15 共查到“lock-in”相关记录27条 . 查询时间(0.093 秒)
2019年11月6日-8日，挪威海洋研究所饲料与营养部门（Institute of Marine Research, IMR, Norway）负责人Erik-Jan Lock教授应邀到淡水渔业研究中心访问交流。淡水渔业研究中心主任徐跑研究员会见了Erik-Jan Lock教授。
Ci-Lock: Cipher Induced Logic Locking Resistant Against SAT Attacks
Logic locking Block cipher Hardware obfuscation
2019/8/30
Protection of intellectual property (IP) cores is one of the most practical security concern for modern integrated circuit (IC) industry. Albeit being well-studied from a practical perspective, the pr...
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles
Fully-Homomorphic Encryption High-Rate Time-Lock Puzzles
2019/6/19
We show how to combine a fully-homomorphic encryption scheme with linear decryption and a linearly-homomorphic encryption schemes to obtain constructions with new properties. Specifically, we present ...
Time-lock puzzles allow one to encrypt messages for the future, by efficiently generating a puzzle with a solution ss that remains hidden until time TT has elapsed. The solution is required to be conc...
Taurolidine-citrate-heparin lock reduces catheter-related bloodstream infections in intestinal failure patients dependent on home parenteral support: a randomized, placebo-controlled trial
antimicrobial catheter lock bacteremia catheter infections
2018/11/19
Background: In patients with intestinal failure who are receiving home parenteral support (HPS), catheter-related bloodstream infections (CRBSIs) inflict health impairment and high costs.
Taurolidine-citrate-heparin lock reduces catheter-related bloodstream infections in intestinal failure patients dependent on home parenteral support: a randomized, placebo-controlled trial
antimicrobial catheter lock bacteremia catheter infections
2018/11/16
Background: In patients with intestinal failure who are receiving home parenteral support (HPS), catheter-related bloodstream infections (CRBSIs) inflict health impairment and high costs.
Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles
Non-malleable Commitments Time-lock Puzzles Two-round
2017/3/27
Non-malleable commitment is a fundamental cryptographic tool for preventing man-in-the-middle attacks. Since its proposal by Dolev, Dwork, and Noar in 1991, a rich line of research has steadily reduce...
A lock placement describes, for each heap location, which lock guards the location, and under what circumstances. We formalize methods for reasoning about lock placements, making precise the interacti...
Lock-free GaussSieve for Linear Speedups in Parallel High Performance SVP Calculation
Linear Speedups High Performance Computing
2016/1/7
Lattice-based cryptography became a hot-topic in the past years because it seems to be quantum immune, i.e., resistant to attacks operated with quantum computers. The security of lattice-based cryptos...
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP
spin-locks compare-and-swap
2016/1/4
In this paper, we assess the practicability of HashSieve, a recently proposed sieving algorithm for the Shortest Vector Problem (SVP) on lattices, on multi-core shared memory systems. To this end, we ...
Non-invasive Spoofing Attacks for Anti-lock Braking Systems
Automotive embedded systems Cyber-physical security Non-invasive sensor attacks
2015/12/30
This work exposes a largely unexplored vector of physical-layer attacks
with demonstrated consequences in automobiles. By modifying the physical
environment around analog sensors such as Antilock Br...
Message-Locked Encryption for Lock-Dependent Messages
deduplication message-locked encryption cloud storage
2015/12/30
Motivated by the problem of avoiding duplication in storage
systems, Bellare, Keelveedhi, and Ristenpart have recently put forward
the notion of Message-Locked Encryption (MLE) schemes which subsume...
Time-lock encryption is a method to encrypt a message such that it can
only be decrypted after a certain deadline has passed. A computationally powerful
adversary should not be able to learn the mes...
Time-Lock Puzzles from Randomized Encodings
2015/12/30
Time-lock puzzles are a mechanism for sending messages “to the future”. A sender can
quickly generate a puzzle with a solution s that remains hidden until a moderately large
amount of time t has ela...
Future Lock-In: Future Implementation Increases Selection of 'Should' Choices
Decision Choices and Conditions Attitudes Conflict and Resolution Cognition and Thinking
2015/4/20
People often experience tension over certain choices (e.g., they should reduce their gas consumption or increase their savings, but they do not want to). Some posit that this tension arises from the c...