搜索结果: 1-15 共查到“军事学 classical”相关记录17条 . 查询时间(0.203 秒)
Randomly Rotate Qubits Compute and Reverse --- IT-Secure Non-Interactive Fully-Compact Homomorphic Quantum Computations over Classical Data Using Random Bases
Homomorphic encryption Quantum cryptography Information-theoretic security
2019/9/16
Homomorphic encryption (HE) schemes enable processing of encrypted data and may be used by a user to outsource storage and computations to an untrusted server. A plethora of HE schemes has been sugges...
Quantum Alice and Silent Bob: Qubit-based Quantum Key Recycling with almost no classical communication
quantum cryptography quantum key recycling
2019/8/2
We introduce a Quantum Key Recycling (QKR) protocol that needs no classical communication from Alice to Bob. Alice sends only a cipherstate, which consists of qubits that are individually measured by ...
Improved Classical Cryptanalysis of the Computational Supersingular Isogeny Problem
Post-quantum cryptography supersingular elliptic curves isogenies
2019/3/21
Two recent papers have made significant advances towards a better understanding of the concrete hardness of the computational supersingular isogeny (CSSI) problem; this problem underlies the supersing...
Classical zero-knowledge arguments for quantum computations
zero knowledge quantum computation
2019/3/1
We show that every language in BQP admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (a...
Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions
hash functions quantum attacks
2018/11/13
Hash functions are of fundamental importance in theoretical and in practical cryptography, and with the threat of quantum computers possibly emerging in the future, it is an urgent objective to unders...
We present an improved version of the one-way to hiding (O2H) lemma by Unruh, J ACM 2015. Our new O2H lemma gives higher flexibility (arbitrary joint distributions of oracles and inputs, multiple repr...
复旦大学计算机科学与技术学院信息安全课件 Classical Encryption Techniques (cont.)
复旦大学计算机科学与技术学院 信息安全 课件 Classical Encryption Techniques (cont.)
2018/7/20
复旦大学计算机科学与技术学院信息安全课件 Classical Encryption Techniques (cont.)。
Quantum FHE (Almost) As Secure as Classical
fully homomorphic encryption learning with errors quantum computation
2018/4/12
Fully homomorphic encryption schemes (FHE) allow to apply arbitrary efficient computation to encrypted data without decrypting it first. In Quantum FHE (QFHE) we may want to apply an arbitrary quantum...
XHX - A Framework for Optimally Secure Tweakable Block Ciphers from Classical Block Ciphers and Universal Hashing
Provable security ideal-cipher model tweakable block cipher
2017/11/13
Tweakable block ciphers are important primitives for designing cryptographic schemes with high security. In the absence of a standardized tweakable block cipher, constructions built from classical blo...
Cryptanalysis against Symmetric-Key Schemes with Online Classical Queries and Offline Quantum Computations
post-quantum cryptography classical query model meet-in-the-middle
2017/10/9
In this paper, quantum attacks against symmetric-key schemes are presented in which adversaries only make classical queries but use quantum computers for offline computations. Our attacks are not as e...
How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers
tweakable blockcipher full security ideal blockcipher
2016/12/9
This paper focuses on building a tweakable blockcipher from a classical blockcipher whose input and output wires all have a size of nn bits. The main goal is to achieve full 2n2n security. Such a twea...
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding
Quantum cryptography proofs of knowledge rewinding
2016/1/23
Quantum zero-knowledge proofs and quantum proofs of knowledge are inherently difficult to analyze because their security analysis uses rewinding. Certain cases of quantum rewinding are handled by th...
Yao's millionaires' problem and decoy-based public key encryption by classical physics
Yao's millionaires' problem decoy-based cryptography computationally unbounded adversary
2016/1/9
We use various laws of classical physics to offer several solutions
of Yao’s millionaires’ problem without using any one-way functions.
We also describe several informationally secure public key enc...
Sealing the Leak on Classical NTRU Signatures
Lattice-based Cryptography Digital Signatures NTRUSign
2016/1/9
Initial attempts to obtain lattice based signatures were closely related to reducing a vector modulo the fundamental parallelepiped of a secret basis (like GGH \cite{GGH97}, or \texttt{NTRUSign} \cite...
Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial
role in the development of modern cryptography. The extensive theory of these protocols, however...