搜索结果: 1-15 共查到“军事学 over time”相关记录185条 . 查询时间(0.218 秒)
A Conditional Privacy Preserving Authentication and Multi Party Group Key Establishment Scheme for Real-Time Application in VANETs
Password Authentication VANET Group-Key generation
2019/9/19
Vehicular Ad-hoc Networks (VANETs) are a cardinal part of intelligent transportation system (ITS) which render various services in terms of traffic and transport management. The VANET is used to manag...
Towards real-time hidden speaker recognition by means of fully homomorphic encryption
Fully Homomorphic Encryption Neural Networks LWE
2019/8/30
Securing Neural Network (NN) computations through the use of Fully Homomorphic Encryption (FHE) is the subject of a growing interest in both communities. Among different possible approaches to that to...
Formal Verification of a Constant-Time Preserving C Compiler
Compilation Formal verification Constant-time security
2019/8/19
Timing side-channels are arguably one of the main sources of vulnerabilities in cryptographic implementations. One effective mitigation against timing side-channels is to write programs that do not pe...
Ouroboros Clepsydra: Ouroboros Praos in the Universally Composable Relative Time Model
proof of stake blockchain UC model
2019/8/19
Ouroboros Praos is a proof of stake based blockchain protocol. One of its security assumptions is parties are synchronized i.e., all of them knows when the protocol passes a new state. However, it is ...
Information Conservational Security with “Black Hole” Keypad Compression and Scalable One-Time Pad — A Quantum Intelligence Approach to Pre- and Post-Quantum Cryptography
Pre- and Post-Quantum Cryptography Scalable One-Time Pad (S-OTP) Information Conservational Security (ICS)
2019/8/14
Whereas it is widely deemed impossible to overcome the optimality of the one-time pad (OTP) cipher in pre- and post-quantum cryptography, this work shows that the optimality of information theoretic s...
Timed-Release Encryption With Master Time Bound Key (Full Version)
timed-release encryption Weil pairing bilinear Diffie-Hellman problem
2019/8/8
Timed-release encryption allows senders to send a message to a receiver which cannot decrypt until a server releases a time bound key at the release time. The release time usually supposed to be known...
One Bit is All It Takes: A Devastating Timing Attack on BLISS’s Non-Constant Time Sign Flips
Lattice-Based Cryptography Cryptanalysis BLISS
2019/8/7
As one of the most efficient lattice-based signature schemes, and one of the only ones to have seen deployment beyond an academic setting (e.g., as part of the VPN software suite strongSwan), BLISS ha...
A new implementation of Falcon is presented. It solves longstanding issues in the existing reference code: the new implementation is constant-time, it does not require floating-point hardware (though ...
The Impact of Time on DNS Security
Network Time Protocol Domain Name System DNS Security Extensions
2019/7/15
Time is an important component of the Domain Name System (DNS) and the DNS Security Extensions (DNSSEC). DNS caches rely on an absolute notion of time (eg "August 8, 2018 at 11:59pm'') to determine ho...
Don't forget your roots: constant-time root finding over F2m
Side-channel Attack Post-quantum Cryptography Code-based Cryptography
2019/7/15
In the last few years, post-quantum cryptography has received much attention. NIST is running a competition to select some post-quantum schemes as standard. As a consequence, implementations of post-q...
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
discrete logarithm problem finite field
2019/6/26
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can ...
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 ...
On designing secure small-state stream ciphers against time-memory-data tradeoff attacks
Stream cipher Ultra-lightweight Small-state
2019/6/10
A new generation of stream ciphers, small-state stream ciphers (SSCs), was born in 2015 with the introduction of the Sprout cipher. The new generation is based on using key bits not only in the initia...
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...
Stopping time signatures for some algorithms in cryptography
foundations number theory discrete logarithm problem
2019/5/23
We consider the normalized distribution of the overall running times of some cryptographic algorithms, and what information they reveal about the algorithms. Recent work of Deift, Menon, Olver, Pfrang...