搜索结果: 1-15 共查到“军事学 building”相关记录26条 . 查询时间(0.14 秒)
RAMPARTS: A Programmer-Friendly System for Building Homomorphic Encryption Applications
Homomorphic encryption Automatic arithmetic circuit generation Lattice-based cryptography
2019/9/3
Homomorphic Encryption (HE) is an emerging technnology that enables computing on data while the data is encrypted. A major challenge with homomorphic encryption is that it takes extensive expert knowl...
Improved Building Blocks for Secure Multi-Party Computation based on Secret Sharing with Honest Majority
cryptographic protocols secret sharing
2019/6/19
Secure multi-party computation permits evaluation of any desired functionality on private data without disclosing the data to the participants and is gaining its popularity due to increasing collectio...
Deep Learning based Model Building Attacks on Arbiter PUF Compositions
physically unclonable function machine learning deep learning
2019/5/28
Robustness to modeling attacks is an important requirement for PUF circuits. Several reported Arbiter PUF com- positions have resisted modeling attacks. and often require huge computational resources ...
Multi-Protocol UC and its Use for Building Modular and Efficient Protocols
Building Modular Efficient Protocols
2019/1/26
We want to design and analyze protocols in a modular way by combining idealized components that we realize individually. While this is in principle possible using security frameworks that provide gene...
Building Quantum-One-Way Functions from Block Ciphers: Davies-Meyer and Merkle-Damgård Constructions
provable security Davies-Meyer one-wayness, non-invertibility
2018/11/16
We present hash functions that are almost optimally one-way in the quantum setting. Our hash functions are based on the Merkle-Damgård construction iterating a Davies-Meyer compression function, ...
Building Militaries in Fragile States: Challenges for the United States (Book Review)
Building Militaries the United States Iraq BWT
2019/10/11
After more than a decade of supporting large expeditionary forces in Iraq and Afghanistan, the U.S. battle cry today is “by, with, and through” (BWT). According to General Joseph Votel, Commander U.S....
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More
FHE Lattice-based cryptography Sampling
2018/11/7
Many advanced lattice cryptography applications require efficient algorithms for inverting the so-called "gadget" matrices, which are used to formally describe a digit decomposition problem that produ...
Cycle Slicer: An Algorithm for Building Permutations on Special Domains
format-preserving encryption small-domain block ciphers Markov chains
2017/9/14
We introduce an algorithm called Cycle Slicer that gives new solutions to two important problems in format-preserving encryption: domain targeting and domain completion. In domain targeting, where we ...
Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness
indistinguishability obfuscation functional encryption
2017/3/2
There is some evidence that indistinguishability obfuscation (iO) requires either exponentially many assumptions or (sub)exponentially hard assumptions, and indeed, all known ways of building obfuscat...
We study the synthesis of small functions used as building blocks in lightweight cryptographic designs in terms of hardware implementations. This phase most notably appears during the ASIC implementat...
Building web applications on top of encrypted data using Mylar
web security end-to-end encryption
2016/12/9
Web applications rely on servers to store and process confidential information. However, anyone who gains access to the server (e.g., an attacker, a curious administrator, or a government) can obtain ...
Bitline PUF: Building Native Challenge-Response PUF Capability into Any SRAM
Physical Unclonable Functions future research
2016/1/7
Physical Unclonable Functions (PUFs) are specialized circuits with applications including key generation and challenge-response authentication. PUF properties such as low cost and resistance to invasi...
Building Lossy Trapdoor Functions from Lossy Encryption
public-key cryptography derandomization injective trapdoor functions oblivious transfer
2016/1/4
Injective one-way trapdoor functions are one of the most fundamental cryptographic primitives. In
this work we show how to derandomize lossy encryption (with long messages) to obtain lossy trapdoor
...
A Challenge Obfuscation Method for Thwarting Model Building Attacks on PUFs
Physical Uncloanble Function obfuscation
2015/12/30
Physical Unclonable Functions (PUFs), as novel lightweight
hardware security primitives, provide a higher level security with lower
power and area overhead in comparison with traditional cryptograph...
A general framework for building noise-free homomorphic cryptosystems
Homomorphic cryptosystem FHE Multivariate encryption scheme
2015/12/23
We present a general framework for developing and analyzing homomorphic cryptosystems whose security
relies on the difficulty of solving systems of nonlinear equations over Zn, n being an RSA modulus...