搜索结果: 1-15 共查到“军事学 computations”相关记录45条 . 查询时间(0.046 秒)
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...
We construct a delegation scheme for all polynomial time computations. Our scheme is publicly verifiable and completely non-interactive in the common reference string (CRS) model.
CSI-FiSh: Efficient Isogeny based Signatures through Class Group Computations
Isogeny-based cryptography digital signature class group
2019/5/21
In this paper we report on a new record class group computation of an imaginary quadratic field having 154-digit discriminant, surpassing the previous record of 130 digits. This class group is central...
Improved Filter Permutators: Combining Symmetric Encryption Design, Boolean Functions, Low Complexity Cryptography, and Homomorphic Encryption, for Private Delegation of Computations
Filter Permutator FLIP Homomorphic Encryption
2019/5/14
Motivated by the application of delegating computation, we revisit the design of filter permutators as a general approach to build stream ciphers that can be efficiently evaluated in a fully homomorph...
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...
Multikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC)protocols, MFHE ca...
Delegating Computations with (almost) Minimal Time and Space Overhead
Delegation schemes argument no-signaling proofs
2018/11/14
The problem of verifiable delegation of computation considers a setting in which a client wishes to outsource an expensive computation to a powerful, but untrusted, server. Since the client does not t...
Location-Proof System based on Secure Multi-Party Computations
Location Proof System Multi-Party Computations Secure Maximum Protocol
2018/6/5
Location-based services are now quite popular. The variety of applications and their numerous users show it clearly. However, these applications rely on the persons' honesty to use their real location...
Efficient and Constant-Rounds Secure Comparison through Dynamic Groups and Asymmetric Computations
cryptographic protocols secure comparison
2018/3/6
Within recent years, secure comparison protocols have been proposed using binary decomposition and properties of algebraic fields. These have been repeatedly optimized and increased in efficiency, but...
Performing Computations on Hierarchically Shared Secrets
hierarchical secret sharing Birkhoff interpolation verifiable secret sharing
2017/10/30
Hierarchical secret sharing schemes distribute a message to a set of shareholders with different reconstruction capabilities. In distributed storage systems, this is an important property because it a...
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...
Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data
verifiable computation data hashes commit and prove
2016/12/8
Proof systems for verifiable computation (VC) have the potential to make cloud outsourcing more trustworthy. Recent schemes enable a verifier with limited resources to delegate large computations and ...
Accelerating Homomorphic Computations on Rational Numbers
Fully Homomorphic Encryption Encoding Confidential Machine Learning
2016/7/7
Fully Homomorphic Encryption (FHE) schemes are conceptually very powerful tools for outsourcing computations on confidential data. However, experience shows that FHE-based solutions are not sufficient...
An Unconditionally Hiding Auditing Procedure for Multi-Party Computations
unconditional hidingness auditable multi-party computations cloud computing
2016/6/3
In this work an unconditionally hiding auditing procedure for computations on documents stored in distributed fashion is introduced. There is only one multi-party computation (MPC) scheme providing au...
Reducing number field defining polynomials: An application to class group computations
number theory class group computation
2016/6/2
In this paper, we describe how to compute smallest monic polynomials that define a given number field K. We make use of the one-to-one correspondence between monic defining polynomials of K and algebr...