標題: Titlebook: High Performance Scientific and Engineering Computing; Proceedings of the I Hans-Joachim Bungartz,Franz Durst,Christoph Zenger Conference p [打印本頁] 作者: tricuspid-valve 時間: 2025-3-21 18:53
書目名稱High Performance Scientific and Engineering Computing影響因子(影響力)
書目名稱High Performance Scientific and Engineering Computing影響因子(影響力)學科排名
書目名稱High Performance Scientific and Engineering Computing網(wǎng)絡公開度
書目名稱High Performance Scientific and Engineering Computing網(wǎng)絡公開度學科排名
書目名稱High Performance Scientific and Engineering Computing被引頻次
書目名稱High Performance Scientific and Engineering Computing被引頻次學科排名
書目名稱High Performance Scientific and Engineering Computing年度引用
書目名稱High Performance Scientific and Engineering Computing年度引用學科排名
書目名稱High Performance Scientific and Engineering Computing讀者反饋
書目名稱High Performance Scientific and Engineering Computing讀者反饋學科排名
作者: 武器 時間: 2025-3-21 22:04
A. Walther,A. Griewanka simple guess-and-determine approach which is efficient enough against these generators..We also present an implemented attack on Trifork, this time using lattice-based techniques. We show it cannot have more than 64 bits of security, hence it is not cryptographically secure.作者: parsimony 時間: 2025-3-22 04:25 作者: foreign 時間: 2025-3-22 05:28
B. Huurdeman,S. N?gele,V. Reichenberger,H. Rentz-Reichertose our own scheme, ULISS (Unlinkable Limited Invisible Sanitizable Signature), then show that it verifies these properties. This extension of SaS can not only improve current use cases, but also introduce new ones, ., restricting the number of changes in a document within a certain timeframe.作者: AMBI 時間: 2025-3-22 08:48
M. Meinke,Th. Rister,F. Rütten,A. Schvorak relying on ORAM. Our key idea is to keep track of the states of updates and the deletion information inside the secure enclave to prevent the leakage from the server. To speed up, we further leverage a compressed data structure to maintain a sketch of addition operations in the enclave to facilitat作者: DENT 時間: 2025-3-22 16:37
M. Franke,Th. Rung,L. Xue,F. Thiele relying on ORAM. Our key idea is to keep track of the states of updates and the deletion information inside the secure enclave to prevent the leakage from the server. To speed up, we further leverage a compressed data structure to maintain a sketch of addition operations in the enclave to facilitat作者: 可憎 時間: 2025-3-22 17:07
U. Becker-Lemgau,M. G. Hackenberg,W. Joppich,S. Mijalkovi?,B. Steckel,Th. Sontowski,R. Tilch relying on ORAM. Our key idea is to keep track of the states of updates and the deletion information inside the secure enclave to prevent the leakage from the server. To speed up, we further leverage a compressed data structure to maintain a sketch of addition operations in the enclave to facilitat作者: Definitive 時間: 2025-3-23 01:09 作者: Clinch 時間: 2025-3-23 03:06 作者: DAUNT 時間: 2025-3-23 06:16
cing and revoking pirate rebroadcasts and (ii) by presenting the first efficient constructions of tracing and revoking pirate rebroadcasts that are capable of performing tracing for . of traitors and revoking . of users. We present three instantiations of our framework: our first construction achiev作者: alcoholism 時間: 2025-3-23 12:13
P. Rentrop,O. Scherf,B. Simeoncal k-means algorithm. Compared to a state-of-the-art FHE-based scheme, our original algorithm not only outperforms theirs in accuracy but is also 4 orders of magnitude faster than theirs. In experiments testing our block algorithm, we conclude that the run time and memory consumption of this algori作者: Gleason-score 時間: 2025-3-23 15:28
C. Chucholowski,M. V?gel,O. von Stryk,T.-M. Wolter protocol for stable matching against a malicious server. Our verification protocol is constructed from CDS schemes for stable matching, which do not require any asymmetric-key cryptographic primitives. From the implementation result, our proposed protocol is 4 to 5 orders of magnitude faster than t作者: 幼稚 時間: 2025-3-23 19:43 作者: DUST 時間: 2025-3-23 23:50
G. Sachs,P. Hermle,W. Kl?cknerhertext overhead even for messages of polynomially-bounded size. We achieve this by introducing a new variant of puncturable encryption defined by Green and Miers (S&P 2015) and combining it with the iO-based approach of Abusalah et al. Finally, we show that our framework can be easily extended to c作者: Feature 時間: 2025-3-24 05:53
R. Mehlhorn,G. Sachs and in other previous work, handling them simultaneously (and efficiently) in a single scheme faces non-trivial challenges. SomePSS protocols can handle batching of . secrets, but all of them are for the honest majority setting. The techniques typically used to accomplish such batching decrease the作者: COW 時間: 2025-3-24 08:47 作者: ALIEN 時間: 2025-3-24 14:16
High Performance Scientific and Engineering ComputingProceedings of the I作者: Abominate 時間: 2025-3-24 18:04 作者: 細絲 時間: 2025-3-24 19:12
ns. A subset of the unknown variables is guessed such that the remaining unknowns can be deduced using the relations. Applications include state recovery for stream ciphers and key-bridging in key-recovery attacks on block ciphers. Since the attack complexity depends on the number of guessed variabl作者: 夾克怕包裹 時間: 2025-3-24 23:19
isting definitions to make them better comparable with each other and determine which bounds a certain requirement on one property poses on some other property. It turns out that, in terms of proposed definitions, verifiability and accountability do not necessarily put constraints on privacy and coe作者: Nebulous 時間: 2025-3-25 05:52
M. Altieri,Chr. Becker,S. Turekmponents. In this paper we further investigate this approach but apply it to a different context that appears in some side-channel attacks. We assume a fixed-window exponentiation algorithm that leaks the . between digits, without leaking the value of the digits themselves..We explain how to exploit作者: 誘使 時間: 2025-3-25 09:14
A. Walther,A. Griewankcryptographically secure. In 2017 was presented a new family of lightweight pseudo-random number generators: Arrow. These generators are based on the same techniques as Trifork and designed to be light, fast and secure, so they can allow private communication between resource-constrained devices. Th作者: 粘連 時間: 2025-3-25 15:03 作者: keloid 時間: 2025-3-25 19:27
M. de Neef,P. Knabner,G. Summ scenarios, sellers prefer to sell pieces of data, such as statistical results derived from the dataset, rather than the entire dataset. Meanwhile, buyers wish to hide the results they retrieve. Since it is not preferable to rely on a trusted third party (TTP), we are wondering, in the absence of TT作者: Indigence 時間: 2025-3-25 23:00
B. Huurdeman,S. N?gele,V. Reichenberger,H. Rentz-Reichertonly editing parts (or blocks) of the message that are admissible for modification..This primitive is an efficient tool, with many formally defined security properties, such as unlinkability, transparency, immutability, invisibility, and unforgeability. An SaS scheme that satisfies these properties 作者: 有惡意 時間: 2025-3-26 02:10 作者: 喚醒 時間: 2025-3-26 07:58 作者: Intractable 時間: 2025-3-26 11:01
U. Becker-Lemgau,M. G. Hackenberg,W. Joppich,S. Mijalkovi?,B. Steckel,Th. Sontowski,R. Tilchprivacy in DSSE receive wide attention due to the rise in a number of emerging attacks exploiting the leakage in data update operations. Forward privacy ensures newly added data is not related to queries issued in the past, whilst backward privacy ensures previously deleted data is not revealed in t作者: Exuberance 時間: 2025-3-26 14:59 作者: ANIM 時間: 2025-3-26 20:27
H.-J. Bungartz,A. Frank,F. Meier,T. Neunhoeffer,S. Schulte...., GOST-256 and GOST-512 which correspond to two different output lengths. Most of the previous analyses of GOST emphasize on the compression function rather than the hash function. In this paper, we focus on security properties of GOST under the hash function setting. First we give two improved 作者: attenuate 時間: 2025-3-27 00:19
f the licensing agreement. This attack defeats any tracing mechanism that requires interaction with the pirate decoder for identifying compromised keys. Merely tracing pirate rebroadcasts is of little use and one should be also able to revoke the involved traitor keys. The only currently known schem作者: 只有 時間: 2025-3-27 02:08 作者: 縮短 時間: 2025-3-27 08:11
P. Rentrop,O. Scherf,B. Simeonrs to outsource privacy-preserving computations without interaction. In this paper, we propose a fully privacy-preserving, effective, and efficient clustering scheme based on CKKS, in which we construct two iterative formulas to solve the challenging ciphertext comparison and division problems, resp作者: puzzle 時間: 2025-3-27 11:57 作者: 刪減 時間: 2025-3-27 13:40 作者: SPER 時間: 2025-3-27 20:25
G. Sachs,P. Hermle,W. Kl?cknerlarly interesting variant is Offline WE (OWE) by Abusalah et al. (ACNS 2016), as the encryption algorithm uses neither obfuscation nor multilinear maps..Current OWE schemes provide only . security. That is, the adversary must commit to their challenge messages . and . . seeing the public parameters.作者: 使尷尬 時間: 2025-3-28 01:13
E. Grigat,G. Sachsnd matrices. To overcome the limitation of large ciphertext expansion that is typical in AGCD-based schemes, we randomize the ciphertexts with a hidden matrix, which allows us to choose smaller parameters. To be able to efficiently evaluate circuits with large multiplicative depth, we use a decompos作者: 高度 時間: 2025-3-28 05:30
R. Mehlhorn,G. Sachsy . parties can efficiently recover .. Proactive Secret Sharing (PSS) retains confidentiality of . even when a . corrupts all parties over the secret’s lifetime, but no more than a threshold . in each epoch (called a refresh period). Withstanding such adversaries is becoming increasingly important w作者: affinity 時間: 2025-3-28 10:10
On the Realistic Performance of Linear Algebra Components in Iterative Solvers2] allows a successive decomposition of ‘global’ problems into smaller ‘local’ subproblems. On the lowest-level ‘local’ patches, highly regular data structures are preferred which allow the use of high-performance Numerical Linear Algebra tools as ingredients in multigrid solvers. Realistic MFLOP ra作者: Migratory 時間: 2025-3-28 12:19 作者: kyphoplasty 時間: 2025-3-28 16:38 作者: 的闡明 時間: 2025-3-28 20:42 作者: RENIN 時間: 2025-3-28 23:52
Multigrid Solution of the Incompressible Navier-Stokes Equations and its Application to Parallel Comis shown. Also the use of such methods on hybrid grids for two-dimensional incompressible laminar and turbulent flows is presented. The necessary hierarchy of uniformly or locally refined grids is generated by a grid generation procedure especially useful for boundary layer flows. In the second part作者: 憎惡 時間: 2025-3-29 03:49
Simulation of Internal and Free Turbulent Flowsulated for compressible flows, is compared for the case of a spatially developing plane turbulent jet. A second-order scheme based on an AUSM method with a central difference of the pressure derivatives and a compact finite difference scheme of sixth order are used with a dynamic model and also with作者: CYN 時間: 2025-3-29 09:41 作者: 焦慮 時間: 2025-3-29 15:26 作者: outskirts 時間: 2025-3-29 16:21 作者: 飲料 時間: 2025-3-29 20:53 作者: 并入 時間: 2025-3-30 02:29
Mechanical Multibody Systems with Deformable Componentsmable bodies are aimed at growing demands for refined simulation. A basic modeling framework for this class of mechanical systems is presented which covers also inelastic material behavior. Moreover, the Differential-Algebraic Equations (DAEs) obtained from semidiscretization in space are classified作者: cajole 時間: 2025-3-30 07:13
Real Time Simulation and Online Control for Virtual Test Drives of Cars models of the vehicle, the road, and the driver are presented. The numerical simulation must be performed in real time for application in Hardware-in-the-Loop experiments. Numerical results are presented for the ISO slalom test.作者: BOOR 時間: 2025-3-30 11:26
Numerical Simulation of Vibrations for the Design of a Rear Axlerder to reduce the weight of cars. This can be reached using new materials that are often more flexible, e.g., using aluminium instead of steel. So the conventional rigid multibody models seem to be no more sufficient for the accurate modeling of all physical properties, in particular the vibrations作者: POLYP 時間: 2025-3-30 15:36 作者: Ophthalmologist 時間: 2025-3-30 18:14
Flight Path Optimization with a New Homotopy Method for Reducing Safety Hazards in Microburstsifferent orders are combined by order controls, is developped that gives way to a significant speedup in the solution of optimal control problems. The proposed method is applied to the problem of escaping from a microburst encountered during landing approach. It can be shown that the optimized three作者: 保守 時間: 2025-3-31 00:07
Integrated User Environment for the Numerical Solution of Optimal Control Problemsn of the problem class addressed, the traditional process of solving these problems is shortly described. A modification of this process is derived, where the documentation of the optimization problem is used as an entry point. The modules of the integrated user environment and their tasks are denot作者: 欄桿 時間: 2025-3-31 01:02 作者: conduct 時間: 2025-3-31 07:09 作者: Bravura 時間: 2025-3-31 11:36
