Page | Title |
---|

1 | A note on the security of Higher-Order Threshold Implementations |

2 | Characterization of MDS mappings |

3 | Continuous Non-Malleable Key Derivation and Its Application to Related-Key Security |

4 | Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs |

5 | Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE) |

6 | Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions |

7 | Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure |

8 | Post-Quantum Secure Onion Routing (Future Anonymity in Today's Budget) |

9 | Rig: A simple, secure and flexible design for Password Hashing |

10 | Simulation-based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms |

11 | Block Cipher Speed and Energy Efficiency Records on the MSP430: System Design Trade-Offs for 16-bit Embedded Applications |

12 | Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR |

13 | Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification |

14 | Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-based |

15 | One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model |

16 | Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption |

17 | Simple Functional Encryption Schemes for Inner Products |

18 | A Linear Attack on a Key Exchange Protocol Using Extensions of Matrix Semigroups |

19 | Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds |

20 | Simpler Efficient Group Signatures from Lattices |

21 | Non-Malleable Condensers for Arbitrary Min-Entropy, and Almost Optimal Protocols for Privacy Amplification |

22 | TMSUI: A Trust Management Scheme of USB Storage Devices for Industrial Control Systems |

23 | Multilinear Maps Using Ideal Lattices without Encodings of Zero |

24 | Non-Abelian Analogs of Lattice Rounding |

25 | Obfuscating Circuits via Composite-Order Graded Encoding |

26 | A More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two |

27 | On the Regularity of Lossy RSA: Improved Bounds and Applications to Padding-Based Encryption |

28 | Optimal software-implemented Itoh-Tsujii inversion for GF(2^{m}) |

29 | Predicate Encryption for Circuits from LWE |

30 | Cryptanalysis of Ascon |

31 | Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence |

32 | Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF |

33 | On the Security of Fresh Re-keying to Counteract Side-Channel and Fault Attacks |

34 | Suit up! Made-to-Measure Hardware Implementations of Ascon |

35 | Cryptographically Secure CRC for Lightweight Message Authentication |

36 | Faster software for fast endomorphisms |

37 | Analysis and Enhancement of Desynchronization Attack on an Ultralightweight RFID Authentication Protocol |

38 | Aggregatable Pseudorandom Functions and Connections to Learning |

39 | Type-Based Verification of Electronic Voting Protocols |

40 | Automated Dynamic Cube Attack on Block Ciphers: Cryptanalysis of SIMON and KATAN |

41 | Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP |

42 | High Performance Lattice-based CCA-secure Encryption |

43 | Group Signature with Deniability: How to Disavow a Signature |

44 | Use of SIMD-Based Data Parallelism to Speed up Sieving in Integer-Factoring Algorithms |

45 | Reliable Information Extraction for Single Trace Attacks |

46 | On the concrete hardness of Learning with Errors |

47 | Linearly Homomorphic Encryption from DDH |

48 | On Obfuscation with Random Oracles |

49 | On Solving Lpn using BKW and Variants |

50 | Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability |

51 | Improved Meet-in-the-Middle Distinguisher on Feistel Schemes |

52 | Interactive Message-Locked Encryption and Secure Deduplication |

53 | Tight Bounds for Keyed Sponges and Truncated CBC |

54 | Non-committing encryption from Φ-hiding |

55 | Richer Efficiency/Security Trade-offs in 2PC |

56 | Better Algorithms for LWE and LWR |

57 | Cold Boot Attacks in the Discrete Logarithm Setting |

58 | Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems |

59 | Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation |

60 | Verified Proofs of Higher-Order Masking |

61 | More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries |

62 | Evaluation and Cryptanalysis of the Pandaka Lightweight Cipher |

63 | CamlCrush: A PKCS\#11 Filtering Proxy |

64 | Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation |

65 | A lightweight-friendly modifcation of GOST block cipher |

66 | Arithmetic Addition over Boolean Masking - Towards First- and Second-Order Resistance in Hardware |

67 | An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting |

68 | A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro |

69 | On the Provable Security of the Iterated Even-Mansour Cipher against Related-Key and Chosen-Key Attacks |

70 | The Sum Can Be Weaker Than Each Part |

71 | Factoring N=p^{r} q^{s} for Large r and s |

72 | Non-Interactive Zero-Knowledge Proofs of Non-Membership |

73 | Oblivious Network RAM |

74 | Mind the Gap: Modular Machine-checked Proofs of One-Round Key Exchange Protocols |

75 | Equivalent Key Recovery Attacks against HMAC and NMAC with Whirlpool Reduced to 7 Rounds |

76 | Fully Structure-Preserving Signatures and Shrinking Commitments |

77 | On the Existence and Constructions of Vectorial Boolean Bent Functions |

78 | Fully Homomorphic Encryption from Ring-LWE：Identity-Based，Arbitrary Cyclotomic，Tighter Parameters |

79 | On the Security of the COPA and Marble Authenticated Encryption Algorithms against (Almost) Universal Forgery Attack |

80 | The Fairy-Ring Dance: Password Authenticated Key Exchange in a Group |

81 | Amortizing Garbled Circuits |

82 | On the Difficulty of Securing Web Applications using CryptDB |

83 | Key Recovery Attack against an NTRU-type Somewhat Homomorphic Encryption Scheme |

84 | On the Disadvantages of Pairing-based Cryptography |

85 | On the behaviors of affine equivalent Sboxes regarding differential and linear attacks |

86 | Practical Compact E-Cash with Arbitrary Wallet Size |

87 | Revisiting Cryptographic Accumulators, Additional Properties and Relations to other Primitives |

88 | Structural Weaknesses in the Open Smart Grid Protocol |

89 | On the security margin of MAC striping |

90 | Structural Evaluation by Generalized Integral Property |

91 | Related-Key Forgeries for Prøst-OTR |

92 | Towards the Generation of a Dynamic Key-Dependent S-Box to Enhance Security |

93 | Generalization of Statistical Criteria for Sboxes |

94 | Some New Results on Binary Polynomial Multiplication |

95 | Rotational Cryptanalysis of ARX Revisited |

96 | Meet in the Middle Attacks on Reduced Round Kuznyechik |

97 | Surreptitiously Weakening Cryptographic Systems |

98 | Adaptive-ID Secure Revocable Identity-Based Encryption from Lattices via Subset Difference Method |

99 | Universally Composable Firewall Architectures using Trusted Hardware |

100 | Influence of Electrical Circuits of ECC Designs on Shape of Electromagnetic Traces measured on FPGA |

101 | Multi-Key Security: The Even-Mansour Construction Revisited |

102 | GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte |

103 | Mergeable Functional Encryption |

104 | Weakening the Isolation Assumption of Tamper-proof Hardware Tokens |

105 | Inner Product Masking Revisited |

106 | Provably weak instances of Ring-LWE |

107 | Dynamic Searchable Symmetric Encryption with Minimal Leakage and Efficient Updates on Commodity Hardware |

108 | Tracing Attacks on U-Prove with Revocation Mechanism |

110 | sHMQV: An Efficient Key Exchange Protocol for Power-limited Devices |

111 | The Multivariate Hidden Number Problem |

112 | Re-encryption Verifiability: How to Detect Malicious Activities of a Proxy in Proxy Re-encryption |

113 | How to Compress Homomorphic Ciphertexts |

114 | Weak Ideal Functionalities for Designing Random Oracles with Applications to Fugue |

115 | Comprehensive Efficient Implementations of ECC on C54xx Family of Low-cost Digital Signal Processors |

116 | Efficient Hardware Design for Computing Pairings Using Few FPGA In-built DSPs |

117 | Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy |

118 | Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms |

119 | Making Masking Security Proofs Concrete Or How to Evaluate the Security of any Leaking Device |

120 | Reconfigurable LUT: Boon or Bane for Secure Applications |

121 | Multi-User Oblivious RAM Secure Against Malicious Servers |

122 | Constructing Mixed-integer Programming Models whose Feasible Region is Exactly the Set of All Valid Differential Characteristics of SIMON |

123 | Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting |

124 | GliFreD: Glitch-Free Duplication - Towards Power-Equalized Circuits on FPGAs |

125 | Multilinear Pseudorandom Functions |

126 | Perfect Structure on the Edge of Chaos |

127 | Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes |

128 | Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications |

129 | Block-wise Non-Malleable Codes |

130 | How to Bootstrap Anonymous Communication |

131 | On Lightweight Stream Ciphers with Shorter Internal States |

132 | Homomorphic Computation of Edit Distance |

133 | Private Computation on Encrypted Genomic Data |

134 | From Related-Key Distinguishers to Related-Key-Recovery on Even-Mansour Constructions |

135 | Generalizing Efficient Multiparty Computation |

136 | Lyra2: Password Hashing Scheme with improved security against time-memory trade-offs |

137 | Multi-keyword Similarity Search Over Encrypted Cloud Data |

138 | A Practical Key Exchange for the Internet using Lattice Cryptography |

139 | Performance Analysis of Some Password Hashing Schemes |

140 | The Random Oracle Model: A Twenty-Year Retrospective |

141 | Analysis of Impossible, Integral and Zero-Correlation Attacks on Type-II Generalized Feistel Networks using the Matrix Method |

142 | Multi-Client Verifiable Computation with Stronger Security Guarantees |

143 | Harder, Better, Faster, Stronger - Elliptic Curve Discrete Logarithm Computations on FPGAs |

144 | Security of the AES with a Secret S-box |

145 | Observations on the SIMON block cipher family |

146 | New Attacks on Feistel Structures with Improved Memory Complexities |

147 | High Precision Fault Injections on the Instruction Cache of ARMv7-M Architectures |

148 | On the Effectiveness of the Remanence Decay Side-Channel to Clone Memory-based PUFs |

149 | Cryptanalysis of HMAC/NMAC-Whirlpool |

150 | Insynd: Privacy-Preserving Secure One-Way Messaging Using Balloons |

151 | Bad directions in cryptographic hash functions |

152 | Inverting the Final exponentiation of Tate pairings on ordinary elliptic curves using faults |

153 | Functional Encryption from (Small) Hardwae Tokens |

154 | Circuits Resilient to Additive Attacks with Applications to Secure Computation |

155 | On Power Splitting Games in Distributed Computation: The Case of Bitcoin Pooled Mining |

156 | Building Lossy Trapdoor Functions from Lossy Encryption |

157 | Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings |

158 | From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting |

159 | Leaked-State-Forgery Attack Against The Authenticated Encryption Algorithm ALE |

160 | Differential-Linear Cryptanalysis of ICEPOLE |

161 | Exploring the Resilience of Some Lightweight Ciphers Against Pro led Single Trace Attacks |

162 | New Multilinear Maps over the Integers |

163 | Indistinguishability Obfuscation from Functional Encryption |

164 | Constant Size Ring Signature Without Random Oracle |

165 | The Cryptographic Hardness of Random Local Functions - Survey |

166 | Naturally Rehearsing Passwords |

167 | Post-Zeroizing Obfuscation: The case of Evasive Circuits |

168 | More PS and H-like bent functions |

169 | Short Schnorr signatures require a hash function with more than just random-prefix resistance |

170 | Stealing Keys from PCs using a Radio: Cheap Electromagnetic Attacks on Windowed Exponentiation |

171 | Authenticated Network Time Synchronization |

172 | Silent Simon: A Threshold Implementation under 100 Slices |

173 | Indistinguishability Obfuscation from Compact Functional Encryption |

174 | A Practical Chosen Message Power Analysis Method on the Feistel-SP ciphers with Applications to CLEFIA and Camellia |

175 | Trivial Nonce-Misusing Attack on Pure OMD |

176 | Key Recovery for LWE in Polynomial Time |

177 | On the Security of an Efficient Group Key Agreement Scheme for MANETs |

178 | How to Incentivize Data-Driven Collaboration Among Competing Parties |

179 | A Simple Method for Obtaining Relations Among Factor Basis Elements for Special Hyperelliptic Curves |

180 | Key-Homomorphic Constrained Pseudorandom Functions |

181 | Links among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis |

182 | Tweakable Blockciphers with Asymptotically Optimal Security |

183 | New Links Between Differential and Linear Cryptanalysis |

184 | Links Between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities |

185 | Remotely Managed Logic Built-In Self-Test for Secure M2M Communications |

186 | Higher Order Differential Analysis of NORX |

187 | How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality |

188 | New Techniques for SPHFs and Efficient One-Round PAKE Protocols |

189 | Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance |

190 | Multi-Client Non-Interactive Verifiable Computation |

191 | iDASH Secure Genome Analysis Competition Using ObliVM |

192 | Memory-saving computation of the pairing fi nal exponentiation on BN curves |

193 | Improving Modular Inversion in RNS using the Plus-Minus Method |

194 | Practical Homomorphic MACs for Arithmetic Circuits |

195 | Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists |

196 | Tighter Reductions for Forward-Secure Signature Schemes |

197 | SCA Resistance Analysis of MAC-PHOTON |

198 | Side-Channel Protection by Randomizing Look-Up Tables on Reconfigurable Hardware - Pitfalls of Memory Primitives |

199 | Side-Channel Security Analysis of Ultra-Low-Power FRAM-based MCUs |

200 | Evaluating the Duplication of Dual-Rail Precharge Logics on FPGAs |

201 | Statistical Properties of Multiplication mod 2^{n} |

202 | Adaptively Secure Coin-Flipping, Revisited |

203 | Achieving Side-Channel Protection with Dynamic Logic Reconfiguration on Modern FPGAs |

204 | Leakage-Resilient Symmetric Encryption via Re-keying |

205 | Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption |

206 | Efficient and Secure Delegation of Group Exponentiation to a Single Server |

207 | Leakage Assessment Methodology - a clear roadmap for side-channel evaluations |

208 | Towards Secure Distance Bounding |

209 | Triathlon of Lightweight Block Ciphers for the Internet of Things |

210 | Secure and Efficient Initialization and Authentication Protocols for SHIELD |

211 | Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing |

212 | Analyzing Permutations for AES-like Ciphers: Understanding ShiftRows |

213 | Attribute-Based Versions of Schnorr and ElGamal |

214 | GCM Security Bounds Reconsidered |

215 | A revocable anonymity in Tor |

216 | Quasi-Adaptive NIZK for Linear Subspaces Revisited |

217 | Salsa20 Cryptanalysis: New Moves and Revisiting Old Styles |

218 | Efficient k-out-of-n oblivious transfer protocol |

219 | Efficient Format Preserving Encrypted Databases |

220 | Key Homomorphic PRFs and Their Applications |

221 | Tighter, faster, simpler side-channel security evaluations beyond computing power |

222 | Towards Understanding the Known-Key Security of Block Ciphers |

223 | New Distinguishers for Reduced Round Trivium and Trivia-SC using Cube Testers |

224 | Privacy and Access Control for Outsourced Personal Records |

225 | Bitwise Linear Mappings with Good Cryptographic Properties and Efficient Implementation |

226 | Secure Physical Computation using Disposable Circuits |

227 | Tradeoff Cryptanalysis of Memory-Hard Functions |

228 | Leakage-Resilient Cryptography with Key Derived from Sensitive Data |

229 | Improving GGH Public Key Scheme Using Low Density Lattice Codes |

230 | W-SPS: Designing a Wide-Area Secure Positioning System |

231 | A Related-Key Chosen-IV Distinguishing Attack on Full Sprout Stream Cipher |

232 | Cryptanalysis of Full Sprout |

233 | Computational Election Verifiability: Definitions and an Analysis of Helios and JCJ |

234 | Collision Attack on 4-branch, Type-2 GFN based Hash Functions using Sliced Biclique Cryptanalysis Technique |

235 | Performance and Security Improvements for Tor: A Survey |

236 | Key Recovery from State Information of Sprout: Application to Cryptanalysis and Fault Attack |

237 | Fast Revocation of Attribute-Based Credentials for Both Users and Verifiers |

238 | One Time Programs with Limited Memory |

239 | Meet-in-the-Middle Attacks and Structural Analysis of Round-Reduced PRINCE |

240 | Differential Analysis and Meet-in-the-Middle Attack against Round-Reduced TWINE |

241 | Espresso: A Stream Cipher for 5G Wireless Communication Systems |

242 | Compactly Hiding Linear Spans: Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications |

243 | Reliable Message Transmission under Partial Knowledge |

244 | Internal Differential Boomerangs: Practical Analysis of the Round-Reduced Keccak-f Permutation |

245 | Practical Attacks on the Round-reduced PRINCE |

246 | Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting |

247 | Subgroup security in pairing-based cryptography |

248 | Verifiably Encrypted Signatures with Short Keys based on the Decisional Linear Problem and Obfuscation for Encrypted VES |

249 | Improved (Hierarchical) Inner-Product Encryption from Lattices |

250 | Design and Analysis of Information-Theoretically Secure Authentication Codes with Non-Uniformly Random Keys |

251 | How to Construct UC-Secure Searchable Symmetric Encryption Scheme |

252 | Linearization of Multi-valued Nonlinear Feedback Shift Registers |

253 | Stability and Linearization of Multi-valued Nonlinear Feedback Shift Registers |

254 | Tornado Attack on RC4 with Applications to WEP & WPA |

255 | A comprehensive analysis of game-based ballot privacy definitions |

256 | Cryptanalysis of Three Certificate-Based Authenticated Key Agreement Protocols and a Secure Construction |

257 | Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices |

258 | Lightweight MDS Involution Matrices |

259 | Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks against Reduced-Round AES |

260 | Computational Aspects of Correlation Power Analysis |

261 | Research Perspectives and Challenges for Bitcoin and Cryptocurrencies |

262 | A look at the PGP ecosystem through the key server data |

263 | Eclipse Attacks on Bitcoin's Peer-to-Peer Network |

264 | BlindBox: Deep Packet Inspection over Encrypted Traffic |

265 | Password Hashing Competition - Survey and Benchmark |

266 | GRECS: Graph Encryption for Approximate Shortest Distance Queries |

267 | The Simplest Protocol for Oblivious Transfer |

268 | Improved Top-Down Techniques in Differential Cryptanalysis |

269 | Ideal Multilinear Maps Based on Ideal Lattices |

270 | Fibonacci Ring Oscillators as True Random Number Generators - A Security Risk |

271 | Toward Secure Implementation of McEliece Decryption |

272 | Leakage-Flexible CCA-secure Public-Key Encryption: Simple Construction and Free of Pairing |

273 | Dual System Encryption via Predicate Encodings |

274 | Low Depth Circuits for Efficient Homomorphic Sorting |

275 | MQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems |

276 | An Improvment of the Elliptic Net Algorithm |

277 | One-Sided Device-Independent QKD and Position-based Cryptography from Monogamy Games |

278 | Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting |

279 | Improved Cryptanalysis of AES-like Permutations |

280 | Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption |

281 | From Statistical Zero Knowledge to Secret Sharing |

282 | Non-Interactive Secure Computation Based on Cut-and-Choose |

283 | Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data |

284 | A Note on Scalar Multiplication Using Division Polynomials |

285 | Improved Linear Trails for the Block Cipher Simon |

286 | Impossible Differential Cryptanalysis of Reduced Round SIMON |

287 | A quantum-safe circuit-extension handshake for Tor |

288 | Precomputation Methods for Faster and Greener Post-Quantum Cryptography on Emerging Embedded Platforms |

289 | Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks |

290 | Automating Fast and Secure Translations from Type-I to Type-III Pairing Schemes |

291 | Two Operands of Multipliers in Side-Channel Attack |

292 | Secret Shared Random Access Machine |

293 | Fully Secure Unbounded Revocable Attribute-Based Encryption in Prime Order Bilinear Groups via Subset Difference Method |

294 | Accelerating Somewhat Homomorphic Evaluation using FPGAs |

295 | Security Analysis of Re-Encryption RPC Mix Nets |

296 | The Uniform Distribution of Sequences Generated by Iteration of Polynomials |

297 | Identity-Based Encryption Secure Against Selective Opening Chosen-Ciphertext Attack |

298 | Secure Random Linear Code Based Public Key Encryption Scheme RLCE |

299 | A Note on the Lindell-Waisbard Private Web Search Scheme |

300 | Scalable Divisible E-cash |

301 | Cryptanalysis of GGH Map |

302 | Boosting OMD for Almost Free Authentication of Associated Data |

303 | The Design Space of Lightweight Cryptography |

304 | Communication-Optimal Proactive Secret Sharing for Dynamic Groups |

305 | Foundations of Reconfigurable PUFs (Full Version) |

306 | Analysis of VAES3 (FF2) |

307 | Black-Box Garbled RAM |

308 | Authenticated Key Exchange over Bitcoin |

309 | TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation |

310 | New algorithm for the discrete logarithm problem on elliptic curves |

311 | Tagged One-Time Signatures: Tight Security and Optimal Tag Size |

312 | Improving Key Recovery to 784 and 799 rounds of Trivium using Optimized Cube Attacks |

313 | Recovering Short Generators of Principal Ideals in Cyclotomic Rings |

314 | Certificate-Based Encryption Resilient to Key Leakage |

315 | Query-Complexity Amplification for Random Oracles |

316 | Non-malleability under Selective Opening Attacks: Implication and Separation |

317 | Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice |

318 | Practical Divisible E-Cash |

319 | Point Decomposition Problem in Binary Elliptic Curves |

320 | Hybrid Publicly Verifiable Computation |

321 | Size-Hiding in Private Set Intersection: what can be done and how to do it without random oracles |

322 | Transformation-Based Outsourcing of Linear Equation Systems over Real Numbers |

324 | A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys |

325 | Secure Multi-Party Computation with Identifiable Abort |

326 | Cryptanalysis Of An Authenticated Image Encryption Scheme Based On Chaotic Maps And Memory Cellular Automata |

327 | Some results on Sprout |

328 | Strongly Secure Authenticated Key Exchange from Ideal Lattices |

329 | PAGES - A Family of Block Ciiphers |

330 | Sponge based CCA2 secure asymmetric encryption for arbitrary length message |

331 | A New Authenticated Encryption Technique for Handling Long Ciphertexts in Memory Constrained Devices |

332 | Security Intelligence for Broadcast : Threat Analytics |

333 | Nearly Optimal Verifiable Data Streaming (Full Version) |

334 | On the Correlation Intractability of Obfuscated Pseudorandom Functions |

335 | Continuous After-the-fact Leakage-Resilient eCK-secure Key Exchange |

336 | Arithmetic Cryptography |

337 | Modular Hardware Architecture for Somewhat Homomorphic Function Evaluation |

338 | Cryptanalysis of a fair anonymity for the tor network |

339 | Guaranteeing Correctness in Privacy-Friendly Outsourcing by Certificate Validation |

340 | A New Distinguisher on Grain v1 for 106 rounds |

341 | Limits on the Power of Indistinguishability Obfuscation and Functional Encryption |

342 | Identity-Set-based Broadcast Encryption supporting "Cut-or-Select" with Short Ciphertext |

343 | High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers |

344 | Watermarking Cryptographic Programs Against Arbitrary Removal Strategies |

345 | Two Round MPC from LWE via Multi-Key FHE |

346 | End-to-End Verifiable Elections in the Standard Model∗ |

347 | Fault Analysis of Kuznyechik |

348 | A Hardware-based Countermeasure to Reduce Side-Channel Leakage - Design, Implementation, and Evaluation |

349 | Efficient Searchable Symmetric Encryption for Storing Multiple Source Data on Cloud |

350 | Improving Local Collisions: New Attacks on Reduced SHA-256 |

351 | Database Outsourcing with Hierarchical Authenticated Data Structures |

352 | Broadcast from Minicast Secure Against General Adversaries |

353 | Matrix Computational Assumptions in Multilinear Groups |

354 | SEMA and MESD Leakage of TinyECC 2.0 on a LOTUS Sensor Node |

355 | Semantic Security and Indistinguishability in the Quantum World |

356 | Succinct Randomized Encodings and their Applications |

357 | A Group-theory Method to The Cycle Structures of Feedback Shift Registers |

358 | On Generalized First Fall Degree Assumptions |

359 | Higher-Order Side Channel Security and Mask Refreshing |

360 | Achieving Differential Privacy with Bias-Control Limited Source |

361 | Computationally binding quantum commitments |

362 | Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem |

363 | Optimally Secure Tweakable Blockciphers |

364 | Privacy-preserving Context-aware Recommender Systems: Analysis and New Solutions |

365 | On the (im)possibility of receiving security beyond 2^{l} using an l-bit PRNG: the case of Wang et. al. protocol |

366 | A random zoo: sloth, unicorn, and trx |

367 | Improved Higher-Order Differential Attacks on MISTY1 |

368 | Breaking the Rabin-Williams digital signature system implementation in the Crypto++ library |

369 | On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation |

370 | Financial Cryptography: Discriminatory Pricing Mechanism |

371 | Constant-Round MPC with Fairness and Guarantee of Output Delivery |

372 | Security Analysis of PRINCE |

373 | Publicly Verifiable Software Watermarking |

374 | On the Impossibility of Tight Cryptographic Reductions |

375 | Bounds on surmising remixed keys |

376 | Cryptography from Post-Quantum Assumptions |

377 | Cluster Computing in Zero Knowledge |

378 | PAC Learning of Arbiter PUFs |

379 | MMBcloud-tree: Authenticated Index for Verifiable Cloud Service Selection |

380 | Protecting against Multidimensional Linear and Truncated Differential Cryptanalysis by Decorrelation |

381 | Financial Cryptography: Algorithmic Mechanisms for a Hedonic Game |

382 | Speed Records for Ideal Lattice-Based Cryptography on AVR |

383 | Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings |

384 | Condensed Unpredictability |

385 | Feasibility and Completeness of Cryptographic Tasks in the Quantum World |

386 | Privately Evaluating Decision Trees and Random Forests |

387 | Method to Protect Passwords in Databases for Web Applications |

388 | Fully Succinct Garbled RAM |

389 | Keccak |

390 | Dual System Encryption Framework in Prime-Order Groups |

391 | On the Communication Complexity of Secure Computation |

392 | Forgery Attacks on round-reduced ICEPOLE-128 |

393 | Biclique cryptanalysis of MIBS-80 and PRESENT-80 |

394 | Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer |

395 | Efficient Unlinkable Sanitizable Signatures from Signatures with Rerandomizable Keys |

396 | Generalizing Homomorphic MACs for Arithmetic Circuits |

397 | Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes |

398 | Factoring RSA moduli with weak prime factors |

399 | New attacks on RSA with Moduli N=p^{rq} |

400 | Expiration and Revocation of Keys for Attribute-based Signatures |

401 | Simple Chosen-Ciphertext Security from Low-Noise LPN |

402 | Success through confidence: Evaluating the effectiveness of a side-channel attack |

403 | Sequential Secret Sharing as a New Hierarchical Access Structure |

404 | Zero-Knowledge Accumulators and Set Operations |

405 | Feasibility and Infeasibility of Secure Computation with Malicious PUFs |

406 | Computation-Trace Indistinguishability Obfuscation and its Applications |

407 | Higher-order cryptanalysis of LowMC |

408 | Revisiting Atomic Patterns for Scalar Multiplications on Elliptic Curves |

409 | Improved Dual System ABE in Prime-Order Groups via Predicate Encodings |

410 | Efficient Ring-LWE Encryption on 8-bit AVR Processors |

411 | Side-Channel Analysis of MAC-Keccak Hardware Implementations |

412 | Survey on Cryptographic Obfuscation |

413 | A study of Pair Encodings: Predicate Encryption in prime order groups |

414 | On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes |

415 | STRIBOB / WHIRLBOB Security Analysis Addendum |

416 | HETest: A Homomorphic Encryption Testing Framework |

417 | Order-Revealing Encryption and the Hardness of Private Learning |

418 | Optimized Interpolation Attacks on LowMC |

419 | Non-invasive Spoofing Attacks for Anti-lock Braking Systems |

420 | What Information is Leaked under Concurrent Composition? |

421 | VLSI Implementation of Double-Base Scalar Multiplication on a Twisted Edwards Curve with an Efficiently Computable Endomorphism |

422 | Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation |

423 | On the Implementation of Unified Arithmetic on Binary Huff Curves |

424 | FIDES: Lightweight Authenticated Cipher with Side-Channel Resistance for Constrained Hardware |

425 | Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices |

426 | Complementing Feistel Ciphers |

427 | A High Reliability PUF Using Hot Carrier Injection Based Response Reinforcement |

428 | Dumb Crypto in Smart Grids: Practical Cryptanalysis of the Open Smart Grid Protocol |

429 | Cryptanalysis of Round-Reduced LED |

430 | Fast and Tradeoff-Resilient Memory-Hard Functions for Cryptocurrencies and Password Hashing |

431 | Conversions among Several Classes of Predicate Encryption and Their Applications |

432 | Non-Repudiable Provable Data Possession in Cloud Storage |

433 | A New Classification of 4-bit Optimal S-boxes and its Application to PRESENT, RECTANGLE and SPONGENT |

434 | Dickson Polynomials that are Involutions |

435 | On the (Fast) Algebraic Immunity of Boolean Power Functions |

436 | On the Resistance of Prime-variable Rotation Symmetric Boolean Functions against Fast Algebraic Attacks |

437 | A Note on the Unsoundness of vnTinyRAM's SNARK |

438 | A Hybrid Approach for Proving Noninterference of Java Programs |

439 | On Concurrently Secure Computation in the Multiple Ideal Query Model |

440 | Message-Locked Encryption for Lock-Dependent Messages |

441 | Enhancing Trust in Reconfigurable Based Hardware Systems with Tags and Monitors |

442 | Individualizing Electrical Circuits of Cryptographic Devices as a Means to Hinder Tampering Attacks |

443 | Security Evaluation and Enhancement of Bistable Ring PUFs |

444 | Revisiting Security Claims of XLS and COPA |

445 | XLS is not a Strong Pseudorandom Permutation |

446 | On the Amortized Complexity of Zero-knowledge Protocols |

447 | A New Model for Error-Tolerant Side-Channel Cube Attacks |

448 | A Comment on Gu Map-1 |

449 | On Constructions of a Sort of MDS Block Diffusion Matrices for Block Ciphers and Hash Functions |

450 | Adaptively Secure Computation with Partial Erasures |

451 | On the Systematic Constructions of Rotation Symmetric Bent Functions with Any Possible Algebraic Degrees |

452 | Masks will Fall Off - Higher-Order Optimal Distinguishers |

453 | An Optimization of Gu Map-1 |

454 | A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO |

455 | Secure Deduplication of Encrypted Data without Additional Independent Servers |

456 | Collateral damage of Facebook Apps: an enhanced privacy scoring model |

457 | Generic Conversions from CPA to CCA secure Functional Encryption |

458 | A Hybrid Approach for the Secure Transmission of H.264/AVC Video Streams |

459 | New Observation on Division Property |

460 | Step by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab |

461 | Cryptanalysis of the multilinear map on the ideal lattices |

462 | Accelerating SWHE based PIRs using GPUs |

463 | Multilinear Maps Using Random Matrix |

464 | Bitcoin and Beyond: A Technical Survey on Decentralized Digital Currencies |

465 | Efficient Arithmetic on ARM-NEON and Its Application for High-Speed RSA Implementation |

466 | Efficient Fully Homomorphic Encryption with Circularly Secure Key Switching Process |

467 | The Oblivious Machine - or: How to Put the C into MPC |

468 | Practical Fully Homomorphic Encryption without Noise Reduction |

469 | Shadow-Bitcoin: Scalable Simulation via Direct Execution of Multi-threaded Applications |

470 | On the Power of Public-key Functional Encryption with Function Privacy |

471 | A Challenge Obfuscation Method for Thwarting Model Building Attacks on PUFs |

472 | High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer |

473 | VARIANTS OF DIFFERENTIAL AND LINEAR CRYPTANALYSIS |

474 | Fully Homomorphic Encryption without bootstrapping |

475 | Randomizing Scalar Multiplication Using Exact Covering Systems of Congruences |

476 | XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees |

477 | Authentication Key Recovery in Galois/Counter Mode (GCM) |

478 | How to Build Time-Lock Encryption |

479 | A Provably Secure Group Signature Scheme from Code-Based Assumptions |

480 | Trinocchio: Privacy-Friendly Outsourcing by Distributed Verifiable Computation |

481 | Advanced Differential Cryptanalysis of Reduced-Round SIMON64/128 Using Large-Round Statistical Distinguishers |

482 | Time-release Protocol from Bitcoin and Witness Encryption for SAT |

483 | Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance |

484 | More Rounds, Less Security? |

485 | Turning Online Ciphers Off |

486 | How to detect unauthorised usage of a key |

487 | Contention in Cryptoland: Obfuscation, Leakage and UCE |

488 | On Black-Box Complexity of Universally Composable Security in the CRS model |

489 | Scalable and private media consumption with Popcorn |

490 | Cryptanalysis Of Dynamic ID Based Remote User Authentication Scheme With Key Agreement |

491 | Re-encryption, functional re-encryption, and multi-hop re-encryption: A framework for achieving obfuscation-based security and instantiations from lattices |

492 | Masking vs. Multiparty Computation: How Large is the Gap for AES? |

493 | Fault Tolerant Infective Countermeasure for AES |

494 | Cryptanalysis of the LSH and SHA-V Hash Functions |

495 | Powers of Subfield Polynomials and Algebraic Attacks on Word-Based Stream Ciphers |

496 | Quantifying Location Privacy Leakage from Transaction Prices |

497 | Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost |

498 | Low Space Complexity CRT-based Bit-Parallel GF(2^{n}) Polynomial Basis Multipliers for Irreducible Trinomials |

499 | Algebraic partitioning: Fully compact and (almost) tightly secure cryptography |

500 | Fault Cryptanalysis of CHES 2014 Symmetric Infective Countermeasure |

501 | Multi-Prover Commitments Against Non-Signaling Attacks |

502 | Centrally Banked Cryptocurrencies |

503 | The Norwegian Internet Voting Protocol: A new Instantiation |

504 | The Iterated Random Permutation Problem with Applications to Cascade Encryption |

505 | The Tower Number Field Sieve |

506 | Compositional Verification of Higher-Order Masking: Application to a Verifying Masking Compiler |

507 | Decomposing the ASASA Block Cipher Construction |

508 | Probabilistic Signature Based Framework for Differential Fault Analysis of Stream Ciphers |

509 | A flaw in a theorem about Schnorr signatures |

510 | Equivoe-T: Transposition Equivocation Cryptography |

511 | Near Collision Side Channel Attacks |

512 | Efficient Key Extraction from the Primary Side of a Switched-Mode Power Supply |

513 | Computing Individual Discrete Logarithms Faster in GF(p^{n)} |

514 | Time-Lock Puzzles from Randomized Encodings |

515 | Higher-Order Differential Meet-in-The-Middle Preimage Attacks on SHA-1 and BLAKE |

516 | Key-Recovery Attacks on ASASA |

517 | Subversion-Resilient Signature Schemes |

518 | Broadcasting Intermediate Blocks as a Defense Mechanism Against Selfish-Mine in Bitcoin |

519 | Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping |

520 | Efficient, Pairing-Free, One Round Attribute-Based Authenticated Key Exchange |

521 | Democoin: A Publicly Verifiable and Jointly Serviced Cryptocurrency |

522 | Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search |

523 | Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ |

524 | Secure Key Exchange Protocol based on Virtual Proof of Reality |

525 | Short Randomizable Signatures |

526 | Generic Key Recovery Attack on Feistel Scheme |

527 | Robust Profiling for DPA-Style Attacks |

528 | Spacemint: A Cryptocurrency Based on Proofs of Space |

529 | Power Analysis Attacks against IEEE 802.15.4 Nodes |

530 | Practical Free-Start Collision Attacks on 76-step SHA-1 |

531 | Reproducible Circularly-Secure Bit Encryption: Applications and Realizations |

533 | Related-Key Rectangle Attack on Round-reduced *Khudra* Block Cipher |

534 | Problems, solutions and experience of the first international student's Olympiad in cryptography |

535 | ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When? |

536 | From Improved Leakage Detection to the Detection of Points of Interests in Leakage Traces |

537 | Towards Easy Leakage Certification |

538 | Pairing Based Mutual Healing in Wireless Sensor Networks |

539 | Tweaking Even-Mansour Ciphers |

540 | PICO: An Ultra lightweight and Low power encryption design for pervasive computing |

541 | Security of Full-State Keyed and Duplex Sponge: Applications to Authenticated Encryption |

542 | Improved Side-Channel Analysis of Finite-Field Multiplication |

543 | Bloom Filters in Adversarial Environments |

544 | Alternative cubics' rules with an algebraic appeal |

545 | FROPUF: How to Extract More Entropy from Two Ring Oscillators in FPGA-Based PUFs |

546 | Actively Secure OT Extension with Optimal Overhead |

547 | Secure Computation of MIPS Machine Code |

548 | Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines |

549 | ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices |

550 | Upending Stock Market Structure Using Secure Multi-Party Computation |

551 | Quantum homomorphic encryption for circuits of low T-gate complexity |

552 | An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices |

553 | Round-Optimal Black-Box Two-Party Computation |

554 | An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security |

555 | Attribute-Based Signcryption : Signer Privacy, Strong Unforgeability and IND-CCA2 Security in Adaptive-Predicates Attack |

556 | Lightweight Coprocessor for Koblitz Curves: 283-bit ECC Including Scalar Conversion with only 4300 Gates |

557 | Improved All-Subkeys Recovery Attacks on FOX, KATAN and SHACAL-2 Block Ciphers |

558 | Efficiency Evaluation of Cryptographic Protocols for Boardroom Voting |

559 | Concurrent Secure Computation with Optimal Query Complexity |

560 | Generic Construction of UC-Secure Oblivious Transfer |

561 | SoC it to EM: electromagnetic side-channel attacks on a complex system-on-chip |

562 | PUDA - Privacy and Unforgeability for Data Aggregation |

563 | Privacy in the Genomic Era |

564 | Sanctum: Minimal RISC Extensions for Isolated Execution |

565 | FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime |

566 | A Framework for Identity-Based Encryption with Almost Tight Security |

567 | Key-Recovery Attack on the ASASA Cryptosystem with Expanding S-boxes |

568 | Cryptanalysis of Reduced-Round Whirlwind (Full Version) |

569 | Improved (Pseudo) Preimage Attacks on Reduced-Round GOST and Grøstl-256 and Studies on Several Truncation Patterns for AES-like Compression Functions (Full Version) |

570 | Constant Communication Oblivious RAM |

571 | Robust and One-Pass Parallel Computation of Correlation-Based Attacks at Arbitrary Order |

572 | On Public Key Encryption from Noisy Codewords |

573 | Last fall degree, HFE, and Weil descent attacks on ECDLP |

574 | Fair and Robust Multi-Party Computation using a Global Transaction Ledger |

575 | Known-key Distinguisher on Full PRESENT |

576 | The Carnac protocol - or how to read the contents of a sealed envelope |

577 | Twist Insecurity |

578 | Tampering with the Delivery of Blocks and Transactions in Bitcoin |

579 | A Simple Proof of a Distinguishing Bound of Iterated Uniform Random Permutation |

580 | Composable & Modular Anonymous Credentials: Definitions and Practical Constructions |

581 | Universal Computational Extractors and the Superfluous Padding Assumption for Indistinguishability Obfuscation |

582 | How Secure and Quick is QUIC? Provable Security and Performance Analyses |

583 | Secure Key Generation from Biased PUFs |

584 | How to Securely Prolong the Computational Bindingness of Pedersen Commitments |

585 | SIMON and SPECK: Block Ciphers for the Internet of Things |

586 | SCLPV: Secure Certificateless Public Verification for Cloud Storage in Cyber-physical-social System |

587 | AN ENHANCED BIOMETRIC BASED REMOTE USER AUTHENTICATION SCHEME USING SMART CARD |

588 | An analysis of the C class of bent functions |

589 | Generating S-Box Multivariate Quadratic Equation Systems And Estimating Algebraic Attack Resistance Aided By SageMath |

590 | TriviA: A Fast and Secure Authenticated Encryption Scheme |

591 | How much randomness can be extracted from memoryless Shannon entropy sources? |

592 | Oblivion: Mitigating Privacy Leaks by Controlling the Discoverability of Online Information |

593 | A Physical Approach for Stochastic Modeling of TERO-based TRNG |

594 | Disk Encryption: Do We Need to Preserve Length? |

595 | Differential Fault Intensity Analysis |

596 | Zeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitations |

597 | Assessment of Hiding the Higher-Order Leakages in Hardware - what are the achievements versus overheads? |

598 | Combining Differential Privacy and Secure Multiparty Computation |

599 | The Chain Rule for HILL Pseudoentropy, Revisited |

600 | Predictive Models for Min-Entropy Estimation |

601 | A Secure Oblivious Transfer Protocol from Indistinguishing Obfuscation |

602 | Combined Side-Channel and Fault Analysis Attack on Protected Grain Family of Stream Ciphers |

603 | Complementary Dual Codes for Counter-measures to Side-Channel Attacks |

604 | Structure-Preserving Signatures from Standard Assumptions, Revisited |

605 | Computing Elliptic Curve Discrete Logarithms with Improved Baby-step Giant-step Algorithm |

606 | Constructing Efficient PAKE Protocols from Identity-Based KEM/DEM |

607 | Netcoin - A Traceable P2P Electronic Cash System |

608 | Fully Secure Functional Encryption for Inner Products, from Standard Assumptions |

609 | Experimental Study of DIGIPASS GO3 and the Security of Authentication |

610 | McBits: fast constant-time code-based cryptography |

611 | A Unified Security Analysis of Two-phase Key Exchange Protocols in TPM 2.0 |

612 | The Simeck Family of Lightweight Block Ciphers |

613 | Accountable Authority Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability and Public Auditing in the Cloud |

614 | Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem |

615 | Security Analysis of Niu et al. Authentication and Ownership Management Protocol |

616 | The leaking battery: A privacy analysis of the HTML5 Battery Status API |

617 | Generalised tally-based decoders for traitor tracing and group testing |

618 | An Authentication Code over Galois Rings with Optimal Impersonation and Substitution Probabilities |

619 | Construction of Arithmetic Secret Sharing Schemes by Using Torsion Limits |

620 | Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions |

621 | Who watches the watchmen? : Utilizing Performance Monitors for Compromising keys of RSA on Intel Platforms |

622 | Random Digit Representation of Integers |

623 | Design, Evaluation and Optimization of Physical Unclonable Functions based on Transient Effect Ring Oscillators |

624 | Automated Analysis and Synthesis of Authenticated Encryption Schemes |

625 | Ed448-Goldilocks, a new elliptic curve |

626 | Practical Round-Optimal Blind Signatures in the Standard Model |

627 | On Necessary Padding with IO |

628 | An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme |

629 | BeleniosRF: A Strongly Receipt-Free Electronic Voting Scheme |

630 | Unconditionally Secure Computation with Reduced Interaction |

631 | Accelerating Homomorphic Evaluation on Reconfigurable Hardware |

632 | More on Impossibility of Virtual Black-Box Obfuscation in Idealized Models |

633 | An Efficient ID-Based Message Recoverable Privacy-Preserving Auditing Scheme |

634 | Phasing: Private Set Intersection using Permutation-based Hashing |

635 | Microcash: Efficient Off-Line Small Payments |

636 | Analyzing Constructions for key-alternating Pseudorandom Functions with Applications to Stream Cipher Operation Modes |

637 | A Novel Cyberspace-Oriented Access Control Model |

638 | An Efficient Many-Core Architecture for Elliptic Curve Cryptography Security Assessment |

639 | Polynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings |

640 | Very-efficient simulatable flipping of many coins into a well |

641 | Noise-free Symmetric Fully Homomorphic Encryption based on noncommutative rings |

642 | A New Partial Key Exposure Attack on Multi-power RSA |

643 | Short Accountable Ring Signatures Based on DDH |

644 | The Pythia PRF Service |

645 | Improvements on Efficient Dynamic Provable Data Possession scheme with Public Verifiability and Data Privacy |

646 | Decomposition attack on SASASASAS |

647 | Efficient ephemeral elliptic curve cryptographic keys |

648 | Adaptive Proofs of Knowledge in the Random Oracle Model |

649 | On the Hardness of Proving CCA-security of Signed ElGamal |

650 | A New Encryption Standard of Ukraine: The Kalyna Block Cipher |

651 | Secure Execution Architecture based on PUF-driven Instruction Level Code Encryption |

652 | Modelling ciphersuite and version negotiation in the TLS protocol |

653 | Homomorphic Signature Schemes - A survey |

654 | DAA-TZ: An Efficient DAA Scheme for Mobile Devices using ARM TrustZone |

655 | An Efficient Multi-Message Multi-Receiver Signcryption Scheme with Forward Secrecy on Elliptic Curves |

656 | Cryptanalysis of a Markov Chain Based User Authentication Scheme |

657 | Randomizing the Montgomery Powering Ladder |

658 | Single-Cycle Implementations of Block Ciphers |

659 | Diversity and Transparency for ECC |

660 | A Hybrid Gaussian Sampler for Lattices over Rings |

661 | Cryptanalysis of a modern rotor machine in a multicast setting |

662 | Strong Security of the Strongly Multiplicative Ramp Secret Sharing based on Algebraic Curves |

663 | Analyzing the Efficiency of Biased-Fault Based Attacks |

664 | Secure Multi-Party Shuffling |

665 | Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption |

666 | Improved Linear Hull Attack on Round-Reduced Simon with Dynamic Key-guessing Techniques |

667 | De Bruijn Sequences from Nonlinear Feedback Shift Registers |

668 | The Fallacy of Composition of Oblivious RAM and Searchable Encryption |

669 | GMU Hardware API for Authenticated Ciphers |

670 | Smart Security Management in Secure Devices |

671 | Privacy-preserving Frequent Itemset Mining for Sparse and Dense Data |

672 | Function-Hiding Inner Product Encryption |

673 | Decaf: Eliminating cofactors through point compression |

674 | Preprocessing-Based Verification of Multiparty Protocols with Honest Majority |

675 | Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts |

676 | Quantum Cryptanalysis of NTRU |

677 | EdDSA for more curves |

678 | Optimizing MAKWA on GPU and CPU |

679 | Another Look at Normal Approximations in Cryptanalysis |

680 | Indifferentiability of Confusion-Diffusion Networks |

681 | ANONIZE: A Large-Scale Anonymous Survey System |

682 | Integral Cryptanalysis on Full MISTY1 |

683 | Security of Linear Secret-Sharing Schemes against Mass Surveillance |

684 | A One-time Stegosystem and Applications to Efficient Covert Communication |

685 | On the discrete logarithm problem in finite fields of fixed characteristic |

686 | Cryptanalysis for Secure and Efficient Smart-Card-Based Remote User Authentication Scheme for Multi-server Environment |

687 | Classical Cryptographic Protocols in a Quantum World |

688 | Binary Field Multiplication on ARMv8 |

689 | How to Enumerate Your Keys Accurately and Efficiently After a Side Channel Attack |

690 | Systematic Reverse Engineering of Cache Slice Selection in Intel Processors |

691 | SpecTre: A Tiny Side-Channel Resistant Speck Core for FPGAs |

692 | Fast and Secure Linear Regression and Biometric Authentication with Security Update |

693 | Foundations of Reactive Garbling Schemes |

694 | On the Complexity of Additively Homomorphic UC Commitments |

695 | Cliptography: Clipping the Power of Kleptographic Attacks |

696 | Novel algorithms and hardware architectures for Montgomery Multiplication over GF(p) |

697 | On the Security of a Self-healing Group Key Distribution Scheme |

698 | Chosen IV Cryptanalysis on Reduced Round ChaCha and Salsa |

699 | FURISC: FHE Encrypted URISC Design |

700 | Four Neighbourhood Cellular Automata as Better Cryptographic Primitives |

701 | Differential Privacy in distribution and instance-based noise mechanisms |

702 | Demystifying incentives in the consensus computer |

703 | Point-Function Obfuscation: A Framework and Generic Constructions |

704 | Indistinguishability Obfuscation: from Approximate to Exact |

705 | Linear Overhead Robust MPC with Honest Majority Using Preprocessing |

706 | A Brief Comparison of Simon and Simeck |

707 | Reconciling User Privacy and Implicit Authentication for Mobile Devices |

708 | Choosing Parameters for NTRUEncrypt |

709 | Detecting Mobile Application Spoofing Attacks by Leveraging User Visual Similarity Perception |

710 | Privacy-Preserving Content-Based Image Retrieval in the Cloud (Extended Version) |

711 | Construction of Lightweight S-Boxes using Feistel and MISTY structures (Full Version) |

712 | On Limitations of the Fiat - Shamir Transformation |

713 | Light-hHB: A New Version of hHB with Improved Session Key Exchange |

714 | New classes of public key cryptosystem K(XVI)SE(1)PKC constructed based on Reed-Solomon code over extension field of m=8 and K(XVI)SE(2)PKC, based on binary cyclic code |

715 | New Circular Security Counterexamples from Decision Linear and Learning with Errors |

716 | Linear Cryptanalysis of Reduced-Round SIMECK Variants |

717 | Towards Secure Cryptographic Software Implementation Against Side-Channel Power Analysis Attacks |

718 | Efficient Asynchronous Accumulators for Distributed PKI |

719 | Consolidating masking schemes |

720 | Output-Compressing Randomized Encodings and Applications |

721 | KDM-Security via Homomorphic Smooth Projective Hashing |

722 | Oblivious Substring Search with Updates |

723 | Cryptanalysis of Feistel Networks with Secret Round Functions |

724 | A masked ring-LWE implementation |

725 | The self-blindable U-Prove scheme by Hanzlik and Kluczniak is forgeable |

726 | Compositions of linear functions and applications to hashing |

727 | DPA, Bitslicing and Masking at 1 GHz |

728 | Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware |

729 | Towards Provably-Secure Remote Memory Attestation |

730 | Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption |

731 | Same Value Analysis on Edwards Curves |

732 | Compact Implementations of LEA Block Cipher for Low-End Microprocessors |

733 | Fully Homomorphic Encryption on Octonion Ring |

734 | On the Security of Extended Generalized Feistel Networks |

735 | Modern Cryptography Through the Lens of Secret Sharing |

736 | Solving LWE via List Decoding |

737 | New multilinear maps from ideal lattices |

738 | Authenticated Encryption without Tag Expansion (or, How to Accelerate AERO) |

739 | Fine-grained sharing of encrypted sensor data over cloud storage with key aggregation |

740 | Predictable Arguments of Knowledge |

741 | On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes |

742 | A Matrix Decomposition Method for Optimal Normal Basis Multiplication |

743 | Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions |

744 | BitCryptor: Bit-Serialized Compact Crypto Engine on Reconfigurable Hardware |

745 | Faster ECC over F_{2571} (feat. PMULL) |

746 | A 2^{70} Attack on the Full MISTY1 |

747 | Self-bilinear Map from One Way Encoding System and Indistinguishability Obfuscation |

748 | A More Cautious Approach to Security Against Mass Surveillance |

749 | Affine Equivalence and its Application to Tightening Threshold Implementations |

750 | Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key |

751 | Fast Garbling of Circuits Under Standard Assumptions |

752 | On Constructing One-Way Permutations from Indistinguishability Obfuscation |

753 | Differential Computation Analysis: Hiding your White-Box Designs is Not Enough |

754 | Related-Key Attack on Full-Round PICARO |

755 | TESLA: Tightly-Secure Efficient Signatures from Standard Lattices |

756 | Cryptanalysis of an Improved One-Way Hash Chain Self-Healing Group Key Distribution Scheme |

757 | Stream Cipher Operation Modes with Improved Security against Generic Collision Attacks |

758 | Ring-LWE Cryptography for the Number Theorist |

759 | Cryptanalysis of Gu's ideal multilinear map |

760 | Investigating SRAM PUFs in large CPUs and GPUs |

761 | Implementation of the SCREAM Tweakable Block Cipher in MSP430 Assembly Language |

762 | A Meet-in-the-Middle Attack on Reduced-Round Kalyna-b/2b |

763 | Highly Efficient GF(2^{8}) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design |

764 | On Generating Coset Representatives of PGL_{2}(F_{q}) in PGL_{2}(F_{q2}) |

765 | Sanitizable Signcryption: Sanitization over Encrypted Data (Full Version) |

766 | Relate-Key Almost Universal Hash Functions: Definitions, Constructions and Applications |

767 | Dual EC: A Standardized Back Door |

768 | Interdiction in Practice - Hardware Trojan Against a High-Security USB Flash Drive |

769 | On the Hardness of Learning with Rounding over Small Modulus |

770 | A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles |

771 | A SAT-based Public Key Cryptography Scheme |

772 | Non-Malleable Encryption: Simpler, Shorter, Stronger |

773 | Distinguishing a truncated random permutation from a random function |

774 | Revisiting Prime Power RSA |

775 | Efficient MDS Diffusion Layers Through Decomposition of Matrices |

776 | Functional Encryption for Turing Machines |

777 | Arithmetic Walsh Transform of Boolean Functions with Linear Structures |

778 | Modular Inversion Hidden Number Problem - Correction and Improvements |

779 | A Simple Scheme, for Strengthening Product-sum Type PKC |

780 | Multilinear Maps from Obfuscation |

781 | Twisted Hessian curves |

782 | Secure two-party computation in applied pi-calculus: models and verification |

783 | Cryptanalysis of the Authenticated Encryption Algorithm COFFE |

784 | Threshold FlipThem: When the winner does not need to take all |

785 | Double-Speed Barrett Moduli |

786 | Buying AES Design Resistance with Speed and Energy |

787 | Backtracking-Assisted Multiplication |

788 | Cracking-Resistant Password Vaults using Natural Language Encoders |

789 | Efficient Hardware Implementations of the Warbler Pseudorandom Number Generator |

790 | On weak and strong 2^{k}-bent Boolean functions |

791 | On the Equivalence of Obfuscation and Multilinear Maps |

792 | Standard Security Does Not Imply Indistinguishability Under Selective Opening |

793 | Algorithmic Information Theory for Obfuscation Security |

794 | Safe-Errors on SPA Protected implementations with the Atomicity Technique |

795 | Fast and Memory-Efficient Key Recovery in Side-Channel Attacks |

796 | Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack |

797 | What Security can we Achieve in 4-Rounds? |

798 | A Stateless Cryptographically-Secure Physical Unclonable Function |

799 | Secure Binary Field Multiplication |

800 | Hybrid WBC: Secure and efficient encryption schemes using the White-Box Cryptography |

801 | Scalar Blinding on Elliptic Curves based on Primes with Special Structure |

802 | Ciphertext-only attack on d*d Hill in O(d13^{d}) |

803 | Statistical and Algebraic Properties of DES |

804 | Secure Multi-party Computation: How to Solve the Problem between Security Intelligence & Business Intelligence |

805 | A classification of elliptic curves with respect to the GHS attack in odd characteristic |

806 | Using State Space Encoding To Counter Biased Fault Attacks on AES Countermeasures |

807 | Fair Distributed Computation of Reactive Functions |

808 | Mass-surveillance without the State: Strongly Undetectable Algorithm-Substitution Attacks |

809 | New Techniques for Electronic Voting |

810 | Improved OR Composition of Sigma-Protocols |

811 | Key-recovery attacks against the MAC algorithm Chaskey |

812 | The Secret Structure of the S-Box of Streebog, Kuznechik and Stribob |

813 | Revisiting Turning Online Cipher Off |

814 | CLKS: Certificateless Keyword Search on Encrypted Data |

815 | On the Power of Hierarchical Identity-Based Encryption |

816 | Analysis of Keyless Massive MIMO-based Cryptosystem Security |

817 | Secure Multi-party Graph Computation |

818 | cuHE: A Homomorphic Encryption Accelerator Library |

819 | Improving the Big Mac Attack on Elliptic Curve Cryptography |

820 | Extended Nested Dual System Groups, Revisited |

821 | A general framework for building noise-free homomorphic cryptosystems |

822 | Efficiently Obfuscating Re-Encryption Program under DDH Assumption |

823 | Efficient (ideal) lattice sieving using cross-polytope LSH |

824 | Efficient Fully Structure-Preserving Signatures for Large Messages |

825 | The Emperor's New Password Creation Policies |

826 | Programmable Hash Functions go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys |

827 | Unbounded Hierarchical Identity-Based Encryption with Efficient Revocation |

828 | State-recovery analysis of Spritz |

829 | Reducing Multilinear Map Levels in Constrained PRFs and ABE |

830 | Unique Signature with Short Output from CDH Assumption |

831 | M-MAP: Multi-Factor Memory Authentication for Secure Embedded Processors |

832 | Characterising and Comparing the Energy Consumption of Side Channel Attack Countermeasures and Lightweight Cryptography on Embedded Devices |

833 | Efficient Key Authentication Service for Secure End-to-end Communications |

834 | Authentication Using Side-Channel Information |

835 | On near prime-order elliptic curves with small embedding degrees |

836 | Ciphertext-Policy Attribute-Based Broadcast Encryption with Small Keys |

837 | Multi-Variate High-Order Attacks of Shuffled Tables Recomputation |

838 | Offline Witness Encryption |

839 | Timing and Lattice Attacks on a Remote ECDSA OpenSSL Server: How Practical Are They Really? |

840 | Related-key Impossible Differential Analysis of Full Khudra |

841 | An Efficient CP-ABE with Constant Size Secret Keys using ECC for Lightweight Devices |

842 | On Linkability and Malleability in Self-blindable Credentials |

843 | Rethinking Privacy for Extended Sanitizable Signatures and a Black-Box Construction of Strongly Private Schemes |

844 | DA-Encrypt: Homomorphic Encryption via Non-Archimedean Diophantine Approximation - Preliminary Report |

845 | Cryptanalysis of the Quadratic Zero-Testing of GGH |

846 | Characterization of Secure Multiparty Computation Without Broadcast |

847 | Exploring Energy Efficiency of Lightweight Block Ciphers |

848 | The Multiplicative Complexity of Boolean Functions on Four and Five Variables |

849 | Regulating the Pace of von Neumann Correctors |

850 | Traceable CP-ABE on Prime Order Groups: Fully Secure and Fully Collusion-resistant Blackbox Traceable |

851 | Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing |

852 | Analysis of a key exchange protocol based on tropical matrix algebra |

853 | Standard Security Does Imply Security Against Selective Opening for Markov Distributions |

854 | Secure Sketch Metamorphosis: Tight Unified Bounds |

855 | A new framework for keystream generators against Correlation, Linear and Distinguishing Attacks |

856 | MGR HASH FUNCTION |

857 | Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy |

858 | Group Signatures Without q-Assumptions |

859 | Factor Base Discrete Logarithms in Kummer Extensions |

860 | Selective Opening Security for Receivers |

861 | A Synthetic Indifferentiability Analysis of Interleaved Double-Key Even-Mansour Ciphers |

862 | Idealizing Identity-Based Encryption |

863 | Is There an Oblivious RAM Lower Bound? |

864 | Encryption Performance Improvements of the Paillier Cryptosystem |

865 | Card-based Cryptographic Protocols Using a Minimal Number of Cards |

866 | Graded Encoding, Variations on a Scheme |

867 | Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security |

868 | Optimally Secure Block Ciphers from Ideal Primitives |

869 | New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators |

870 | Gambling, Computational Information and Encryption Security |

871 | A Complete and Linear Physical Characterization Methodology for the Arbiter PUF Family |

872 | Traceability Improvements of a New RFID Protocol Based On EPC C1G2 |

873 | On the Diffusion Property of Iterated Functions |

874 | Feistel Networks: Indifferentiability at 10 Rounds |

875 | Bent and Semi-bent Functions via Linear Translators |

876 | 10-Round Feistel is Indifferentiable from an Ideal Cipher |

877 | Study of a Parity Check Based Fault-Detection Countermeasure for the AES Key Schedule |

878 | Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model |

879 | Computing information on domain parameters from public keys selected uniformly at random |

880 | Generic Efficient Dynamic Proofs of Retrievability |

881 | Generic Security of NMAC and HMAC with Input Whitening |

882 | A Generic Countermeasure Against Fault Injection Attacks on Asymmetric Cryptography |

883 | Revisiting Sum of CBC-MACs and Extending NI2-MAC to Achieve Beyond-Birthday Security |

884 | General Circuit Realizing Compact Revocable Attribute-Based Encryption from Multilinear Maps |

885 | A New Standard of Ukraine: The Kupyna Hash Function |

886 | Applying Cryptographic Acceleration Techniques to Error Correction |

887 | Round-Optimal Token-Based Secure Computation |

888 | Tweak-Length Extension for Tweakable Blockciphers |

889 | Which Ring Based Somewhat Homomorphic Encryption Scheme is Best? |

890 | MI-T-HFE, a New Multivariate Signature Scheme |

891 | Private Ciphertext-Policy Attribute-based Encryption Schemes With Constant-Size Ciphertext Supporting CNF Access Policy |

892 | Security Against Related Randomness Attacks via Reconstructive Extractors |

893 | Robust Authenticated Encryption and the Limits of Symmetric Cryptography |

894 | Comparison of cube attacks over different vector spaces |

895 | Rogue Decryption Failures: Reconciling AE Robustness Notions |

896 | Improved Attacks on Reduced-Round Camellia-128/192/256 |

897 | Integrity-Aware Parallelizable Cipher Feedback Mode for Real-time Cryptography |

898 | Seriously, get off my cloud! Cross-VM RSA Key Recovery in a Public Cloud |

899 | Privacy-preserving Attribute Based Searchable Encryption |

900 | New Results on Identity-based Encryption from Quadratic Residuosity |

901 | A Unified Approach to MPC with Preprocessing using OT |

902 | Differential Security Evaluation of Simeck with Dynamic Key-guessing Techniques |

903 | A Note on the Indifferentiability of the 10-Round Feistel Construction |

904 | Almost-tight Identity Based Encryption against Selective Opening Attack |

905 | Mapping the Intel Last-Level Cache |

906 | RoadRunneR: A Small And Fast Bitslice Block Cipher For Low Cost 8-bit Processors |

907 | Cryptographic Assumptions: A Position Paper |

908 | Linear Distinguishers in the Key-less Setting: Application to PRESENT |

909 | On the Impact of Known-Key Attacks on Hash Functions |

910 | QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions |

911 | Security Evaluation on Simeck against Zero Correlation Linear Cryptanalysis |

912 | Extraction of intrinsic structure for Hardware Trojan detection |

913 | Functional Signcryption: Notion, Construction, and Applications |

914 | A Cryptographic Analysis of the TLS 1.3 Handshake Protocol Candidates |

915 | A Generic Construction for Verifiable Attribute-based Keyword Search Schemes |

916 | Rigorous Upper Bounds on Data Complexities of Block Cipher Cryptanalysis |

917 | Private Proximity Testing on Steroids: An NTRU-based Protocol |

918 | Finding State Collisions in the Authenticated Encryption Stream Cipher ACORN |

919 | PRAMOD: A Privacy-Preserving Framework for Supporting Efficient and Secure Database-as-a-Service |

920 | Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage |

921 | Identity-Based Revocation from Subset Difference Methods under Simple Assumptions |

922 | Localised Multisecret Sharing |

923 | Dynamic Key-Aggregate Cryptosystem on Elliptic Curves for Online Data Sharing |

924 | Masking Large Keys in Hardware: A Masked Implementation of McEliece |

925 | Exploiting the Order of Multiplier Operands: A Low Cost Approach for HCCA Resistance |

926 | Criterion of Maximal Period of a Trinomial over Nontrivial Galois Ring of odd Characteristic |

927 | Rich Queries on Encrypted Data: Beyond Exact Matches |

928 | HLDCA-WSN: Homomorphic Lightweight Data Confidentiality Algorithm for Wireless Sensor Network |

929 | Are you The One to Share? Secret Transfer with Access Structure |

930 | Nearly Sparse Linear Algebra |

931 | Fast and Secure Three-party Computation: The Garbled Circuit Approach |

932 | Using Tweaks To Design Fault Resistant Ciphers |

933 | Cryptanalysis of Provably Secure Certi cateless Short Signature Scheme |

934 | Cryptanalysis of the New CLT Multilinear Maps |

935 | Joint Data and Key Distribution of the Linear Cryptanalysis Test Statistic and Its Impact to Data Complexity Estimates of Multiple/Multidimensional Linear and Truncated Differential Attacks |

936 | A Privacy Preserving Improvement for SRTA in Telecare Medicine Information System |

937 | End-to-end Design of a PUF-based Privacy Preserving Authentication Protocol |

938 | Lattice Based Cryptography for Beginners |

939 | A Decade of Lattice Cryptography |

940 | Secure Association for the Internet of Things |

941 | Cryptanalysis of the New Multilinear Map over the Integers |

942 | Secrecy and independence for election schemes |

943 | Sandy2x: New Curve25519 Speed Records |

944 | New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields |

945 | Secure Set-based Policy Checking and Its Application to Password Registration |

946 | Asymmetric proof-of-work based on the Generalized Birthday problem |

947 | Weave ElGamal Encryption for Secure Outsourcing Algebraic Computations over Zp |

948 | A Provably Secure Short Signature Scheme from Coding Theory |

949 | Private Processing of Outsourced Network Functions: Feasibility and Constructions |

950 | A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer |

951 | Nearly Optimal Robust Secret Sharing |

952 | Commitment and Oblivious Transfer in the Bounded Storage Model with Errors |

953 | Gaussian Sampling Precision and Information Leakage in Lattice Cryptography |

954 | Online-Offline Homomorphic Signatures for Polynomial Functions |

955 | On the Power of Pair Encodings: Frameworks for Predicate Cryptographic Primitives |

956 | Analysis of the Kupyna-256 Hash Function |

957 | Delegating RAM Computations |

958 | One-key Double-Sum MAC with Beyond-Birthday Security |

959 | Cryptanalysis of the Round-Reduced Kupyna Hash Function |

960 | More Efficient Secure Outsourcing Methods for Bilinear Maps |

961 | Short Structure-Preserving Signatures |

962 | SOME REMARKS ON THE LOGARITHMIC SIGNATURES OF FINITE ABELIAN GROUPS |

963 | When Organized Crime Applies Academic Results - A Forensic Analysis of an In-Card Listening Device |

964 | Linear (hull) Cryptanalysis of Round-reduced Versions of KATAN |

965 | Private Genome Analysis through Homomorphic Encryption |

966 | Vulnerabilities of "McEliece in the World of Escher" |

967 | Freestart collision on full SHA-1 |

968 | Differential and Linear Cryptanalysis of ARX with Partitioning - Application to FEAL and Chaskey |

969 | Zero-Knowledge Interactive Proof Systems for New Lattice Problems |

970 | Multilinear Maps over the Integers Using Modulus Switching |

971 | Attacks on Search RLWE |

972 | Cut Down the Tree to Achieve Constant Complexity in Divisible E-Cash |

973 | Some Cryptanalytic Results on Zipper Hash and Concatenated Hash |

974 | The Conjoined Microprocessor |

975 | Extended Functionality in Verifiable Searchable Encryption |

976 | On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure |

977 | Faster point scalar multiplication on NIST elliptic curves over GF(p) using (twisted) Edwards curves over GF(p³) |

978 | The OPTLS Protocol and TLS 1.3 |

979 | Guidelines for Using the CryptDB System Securely |

980 | Analysis of an RFID Authentication Protocol in Accordance with EPC Standards |

981 | Searching and Sorting of Fully Homomorphic Encrypted Data on Cloud |

982 | A note on constructions of bent functions from involutions |

983 | Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes |

984 | Complexity of ECDLP under the First Fall Degree Assumption |

985 | Polynomial time reduction from 3SAT to solving low first fall degree multivariable cubic equations system |

986 | Bit Coincidence Mining Algorithm |

987 | Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries |

988 | Improved Linear Cryptanalysis of reduced-round SIMON-32 and SIMON-48 |

989 | Fast Oblivious AES\\A dedicated application of the MiniMac protocol |

990 | Encryption Switching Protocols |

991 | Ed3363 (HighFive) - An alternative Elliptic Curve |

992 | Multilinear Map via Scale-Invariant FHE: Enhancing Security and Efficiency |

993 | Bi-Deniable Inner Product Encryption from LWE |

994 | An Efficient Scheme to Reduce Side-Channel Leakage of MAC-Keccak for Smart Card |

995 | Updates on Sorting of Fully Homomorphic Encrypted Data |

996 | Multi-user Schnorr security, revisited |

997 | Incremental Program Obfuscation |

998 | All or Nothing at All |

999 | Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption |

1000 | Factoring as a Service |

1001 | Dismantling real-world ECC with Horizontal and Vertical Template Attacks |

1002 | got HW crypto? On the (in)security of a Self-Encrypting Drive series |

1003 | Results on polynomial interpolation with mixed modular operations and unknown moduli |

1004 | Security Analysis of Cryptosystems Using Short Generators over Ideal Lattices |

1005 | Cryptanalysis of Yasuda, Takagi and Sakurai's Signature Scheme Using Invariant Subspaces |

1006 | Confidential Benchmarking based on Multiparty Computation |

1007 | How to Vote Privately Using Bitcoin |

1008 | Provisions: Privacy-preserving proofs of solvency for Bitcoin exchanges |

1009 | Applications of Key Recovery Cube-attack-like |

1010 | TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption |

1011 | Hierarchical Functional Encryption |

1012 | An Efficient Multiple PKG Compatible Identity Based Key Agreement for Vehicular Networks |

1013 | Inception Makes Non-malleable Codes Stronger |

1014 | Fast Fourier Orthogonalization |

1015 | On Bitcoin as a public randomness source |

1016 | Lifting the Security of NI-MAC Beyond Birthday Bound |

1017 | Functional Encryption: Decentralised and Delegatable |

1018 | A Riddle Wrapped in an Enigma |

1019 | Speed-Security Tradeoffs in Blockchain Protocols |

1020 | Attacking the Network Time Protocol |

1021 | New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryption and Their Application |

1022 | Recent progress on the elliptic curve discrete logarithm problem |

1023 | Indistinguishability Obfuscation with Constant Size Overhead |

1024 | Parallel Implementation of Number Theoretic Transform |

1025 | PAGES+, PAGES-, and PAGES- - Three Families of Block Ciphers |

1026 | Hardness Estimation of LWE via Band Pruning |

1027 | Extended Tower Number Field Sieve: A New Complexity for Medium Prime Case |

1028 | Reviving the Idea of Incremental Cryptography for the Zettabyte era Use case: Incremental Hash Functions Based on SHA-3 |

1029 | The Energy Budget for Wireless Security: Extended Version |

1030 | SECOND COORDINATE SEQUENCE OF MP-LRS OVER NONTRIVIAL GALOIS RING OF ODD CHARACTERISTIC |

1031 | Secure Dating with Four or Fewer Cards |

1032 | Essentially Optimal Robust Secret Sharing with Maximal Corruptions |

1033 | The Ultimate Transposition Cipher (UTC) |

1034 | Real time detection of cache-based side-channel attacks using Hardware Performance Counters |

1035 | CARIBE: Adapting Traditional IBE for the Modern Key-Covetous Appetite |

1036 | Patterson-Wiedemann type functions on 21 variables with Nonlinearity greater than Bent Concatenation bound |

1037 | Cryptanalysis of GGH15 Multilinear Maps |

1038 | Revisiting LEGOs: Optimizations, Analysis, and their Limit |

1039 | Maturity and Performance of Programmable Secure Computation |

1040 | Fully Homomorphic Encryption with Composite Number Modulus |

1041 | The Number of Boolean Functions with Multiplicative Complexity 2 |

1042 | ARMed SPHINCS - Computing a 41KB signature in 16KB of RAM |

1043 | The Index j in RC4 is not Pseudo-random due to Non-existence of Finney Cycle |

1044 | Homomorphic evaluation requires depth |

1045 | Exploiting Transformations of the Galois Configuration to Improve Guess-and-Determine Attacks on NFSRs |

1046 | From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back |

1047 | Reconfigurable Cryptography: A flexible approach to long-term security |

1048 | Verifiable Random Functions from Standard Assumptions |

1049 | Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers |

1050 | Comparison Between Irreducible and Separable Goppa Code in McEliece Cryptosystem |

1051 | Cryptanalysis and Improvement of Identity-based Proxy Multi-signature scheme |

1052 | PLayPUF: Programmable Logically Erasable PUFs for Forward and Backward Secure Key Management |

1053 | Oblivious Parallel RAM: Improved Efficiency and Generic Constructions |

1054 | Computational Soundness of Uniformity Properties for Multi-party Computation based on LSSS |

1055 | Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits |

1056 | Information-theoretic Local Non-malleable Codes and their Applications |

1057 | The Complexity of Computing the Optimal Composition of Differential Privacy |

1058 | Rational Sumchecks |

1059 | A General Framework for Redactable Signatures and New Constructions |

1060 | Complete addition formulas for prime order elliptic curves |

1061 | On Basing Private Information Retrieval on NP-Hardness |

1062 | Lower Bounds on Assumptions behind Indistinguishability Obfuscation |

1063 | Optimal Computational Split-state Non-malleable Codes |

1064 | Déjà Q: Encore! Un Petit IBE |

1065 | Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM |

1066 | Cryptanalysis of A Privacy-Preserving Smart Metering Scheme Using Linkable Anonymous Credential |

1067 | Public Verifiability in the Covert Model (Almost) for Free |

1068 | Black-Box Parallel Garbled RAM |

1069 | Feistel Networks: Indifferentiability at 8 Rounds |

1070 | Barriers to Black-Box Constructions of Traitor Tracing Systems |