找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Confe; Part II Jerzy Świątek,Leszek Borzemsk

[复制链接]
楼主: exterminate
发表于 2025-3-23 10:11:23 | 显示全部楼层
发表于 2025-3-23 17:32:12 | 显示全部楼层
Andrzej Najgebaueress allows the verifier to update the SRS one time and bypass the need for a trusted third party. Then, we show that using a similar OR language, given a NI zap (of knowledge) and a . signature scheme, one can build NIZK arguments that can achieve Sub-ZK and . simulation soundness (resp. . simulatio
发表于 2025-3-23 21:52:46 | 显示全部楼层
Maciej Hojda,Grzegorz Filcek,Grzegorz Popek arguments (regardless of efficiency). More specifically we consider the notion of quasi-polynomial time simulation proposed by Pass in [EUROCRYPT 2003] and combine it with simulation and extraction with non-programmable random oracles thus obtaining a NIZK argument of knowledge where neither the ze
发表于 2025-3-24 00:28:35 | 显示全部楼层
Kamil Banach,Rafał Kasprzyk arguments (regardless of efficiency). More specifically we consider the notion of quasi-polynomial time simulation proposed by Pass in [EUROCRYPT 2003] and combine it with simulation and extraction with non-programmable random oracles thus obtaining a NIZK argument of knowledge where neither the ze
发表于 2025-3-24 02:21:53 | 显示全部楼层
发表于 2025-3-24 08:24:15 | 显示全部楼层
Radhwan Al-Jawadi,Marcin Studniarski,Aisha Younusders. An attack on ORide was published at SAC 2021. The same paper proposes a countermeasure using noisy Euclidean distances to thwart their attack. We extend our attack to determine locations of drivers when given their permuted and noisy Euclidean distances from multiple points of reference, where
发表于 2025-3-24 11:46:03 | 显示全部楼层
发表于 2025-3-24 18:33:48 | 显示全部楼层
Oleksandr Sokolov,Veslava Osińska,Aleksandra Mrela,Włodzisław Duch,Marcin Burakders. An attack on ORide was published at SAC 2021. The same paper proposes a countermeasure using noisy Euclidean distances to thwart their attack. We extend our attack to determine locations of drivers when given their permuted and noisy Euclidean distances from multiple points of reference, where
发表于 2025-3-24 21:08:15 | 显示全部楼层
发表于 2025-3-25 00:17:02 | 显示全部楼层
Galina Setlak,Lukasz Paskonction are not used. That rises the following question with the aim of improving the efficiency: can these spaces be used while retaining the same level of security as .? In this paper, we consider the following three .-type MACs..We show that none of the above MACs achieve the same level of securit
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-16 16:50
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表