搜索结果: 1-15 共查到“军事学 online”相关记录50条 . 查询时间(0.125 秒)
Secure Trick-Taking Game Protocols: How to Play Online Spades with Cheaters
Trick-Taking Games Zero-Knowledge Spades, Bridge
2019/4/15
Trick-Taking Games (TTGs) are card games in which each player plays one of his cards in turn according to a given rule. The player with the highest card then wins the trick, i.e., he gets all the card...
Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing
Secure Multiparty Computation SPDZ concrete efficiency
2019/1/29
Secure multiparty computation allows a set of mutually distrusting parties to securely compute a function of their private inputs, revealing only the output, even if some of the parties are corrupt. R...
Is there an Oblivious RAM Lower Bound for Online Reads?
Oblivious RAM Lower Bounds Locally Decodable Codes
2018/6/25
Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (JACM 1996), can be used to read and write to memory in a way that hides which locations are being accessed. The best known ORAM schemes hav...
PPAD: Privacy Preserving Group-Based ADvertising in Online Social Networks
Advertising Online Social Networks Privacy-Preserving Advertising
2018/4/10
Services provided as free by Online Social Networks (OSN) come with privacy concerns. Users' information kept by OSN providers are vulnerable to the risk of being sold to the advertising firms. To pro...
Adaptively Secure Garbling with Near Optimal Online Complexity
Errors assumption standard model
2018/3/7
We construct an adaptively secure garbling scheme with an online communication complexity of n+m+poly(log|C|,sec)n+m+poly(log|C|,sec) where C:{0,1}n→{0,1}mC:{0,1}n→{0,1}m is the circuit being g...
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...
Linking Online Misuse-Resistant Authenticated Encryption and Blockwise Attack Models
Symmetric-key Cryptography Authenticated Encryption Online Encryption
2017/3/6
Real-world applications of authenticated encryption often require the encryption to be computable {online}, e.g. to compute the ithith block of ciphertext after having processed the first ii blocks of...
Non-Interactive Secure 2PC in the Offline/Online and Batch Settings
secure two-party computation garbled circuits batched cut-and-choose
2017/2/20
In cut-and-choose protocols for two-party secure computation (2PC) the main overhead is the number of garbled circuits that must be sent. Recent work (Lindell, Riva; Huang et al., Crypto 2014) has sho...
Succinct Predicate and Online-Offline Multi-Input Inner Product Encryptions under Standard Static Assumptions
inner-product-predicate encryption attribute-based encryption
2016/12/9
This paper presents expressive predicate encryption (PE) systems, namely non-zero inner-product-predicate encryption (NIPPE) and attribute-based encryption (ABE) supporting monotone span programs achi...
Secure Computation in Online Social Networks
Secure multi-party computation online social network privacy
2016/12/8
Apart from their numerous other benefits, online social networks (OSNs) allow users to jointly compute on each other’s data (e.g., profiles, geo-locations, medical records, etc.). Privacy issues natur...
Online ciphers, in spite of being insecure against an sprp adversary, can
be desirable at places because of their ease of implementation and speed. Here we
propose a single-keyed inverse-free constr...
Faster Malicious 2-party Secure Computation with Online/Ofine Dual Execution
secure computation garbled circuits dual execution
2016/6/22
We describe a highly optimized protocol for general-purpose secure two-party computation (2PC) in the presence of malicious adversaries. Our starting point is a protocol of Kolesnikov \etal (TCC 2015)...
CompGC: Efficient Offline/Online Semi-honest Two-party Computation
efficient secure two-party computation garbled circuits implementation
2016/5/17
We introduce a new technique, component-based garbled circuits, for increasing the efficiency of secure two-party computation in the offline/online semi-honest setting. We observe that real-world func...
Canary Numbers: Design for Light-weight Online Testability of True Random Number Generators
TRNG FPGA Online Test
2016/4/18
We introduce the concept of canary numbers, to be used in
health tests for true random number generators. Health tests are essential
components of true random number generators because they are used...
Online-Offline Functional Encryption for Bounded Collusions
functional encryption learning with errors
2016/4/12
We give a new construction of bounded key functional encryption. Our scheme is well suited
for optimization in an online-offline model that allows for preparation in an offline phase, where
a majori...