找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Cryptography in Constant Parallel Time; Benny Applebaum Book 2014 Springer-Verlag Berlin Heidelberg 2014 Computational Complexity.Cryptana

[復(fù)制鏈接]
查看: 42655|回復(fù): 35
樓主
發(fā)表于 2025-3-21 18:36:23 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Cryptography in Constant Parallel Time
編輯Benny Applebaum
視頻videohttp://file.papertrans.cn/241/240589/240589.mp4
概述The author‘s related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007.Assumes only a minimal background in computational complexity and cryptography.Introduces general
叢書(shū)名稱Information Security and Cryptography
圖書(shū)封面Titlebook: Cryptography in Constant Parallel Time;  Benny Applebaum Book 2014 Springer-Verlag Berlin Heidelberg 2014 Computational Complexity.Cryptana
描述.Locally computable (NC.0.) functions are "simple" functions for which every bit of the output can be computed by reading a small number of bits of their input. The study of locally computable cryptography attempts to construct cryptographic functions that achieve this strong notion of simplicity and simultaneously provide a high level of security. Such constructions are highly parallelizable and they can be realized by Boolean circuits of constant depth..This book establishes, for the first time, the possibility of local implementations for many basic cryptographic primitives such as one-way functions, pseudorandom generators, encryption schemes and digital signatures. It also extends these results to other stronger notions of locality, and addresses a wide variety of fundamental questions about local cryptography. The author‘s related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007, and this book includes some expanded sections and proofs, and notes on recent developments..The book assumes only a minimal background in computational complexity and cryptography and is therefore suitable for graduate students or researchers in related areas who are
出版日期Book 2014
關(guān)鍵詞Computational Complexity; Cryptanalysis; Cryptography; Cryptology; NC0; One-Way Functions (OWF); Pseudoran
版次1
doihttps://doi.org/10.1007/978-3-642-17367-7
isbn_softcover978-3-662-50713-1
isbn_ebook978-3-642-17367-7Series ISSN 1619-7100 Series E-ISSN 2197-845X
issn_series 1619-7100
copyrightSpringer-Verlag Berlin Heidelberg 2014
The information of publication is updating

書(shū)目名稱Cryptography in Constant Parallel Time影響因子(影響力)




書(shū)目名稱Cryptography in Constant Parallel Time影響因子(影響力)學(xué)科排名




書(shū)目名稱Cryptography in Constant Parallel Time網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Cryptography in Constant Parallel Time網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Cryptography in Constant Parallel Time被引頻次




書(shū)目名稱Cryptography in Constant Parallel Time被引頻次學(xué)科排名




書(shū)目名稱Cryptography in Constant Parallel Time年度引用




書(shū)目名稱Cryptography in Constant Parallel Time年度引用學(xué)科排名




書(shū)目名稱Cryptography in Constant Parallel Time讀者反饋




書(shū)目名稱Cryptography in Constant Parallel Time讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:14:38 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:27:18 | 只看該作者
地板
發(fā)表于 2025-3-22 07:59:09 | 只看該作者
Information Security and Cryptographyhttp://image.papertrans.cn/d/image/240589.jpg
5#
發(fā)表于 2025-3-22 10:08:43 | 只看該作者
Cryptography in Constant Parallel Time978-3-642-17367-7Series ISSN 1619-7100 Series E-ISSN 2197-845X
6#
發(fā)表于 2025-3-22 14:42:34 | 只看該作者
Computationally Private Randomizing Polynomials and Their Applications,
7#
發(fā)表于 2025-3-22 17:51:02 | 只看該作者
On Pseudorandom Generators with Linear Stretch in ,,,
8#
發(fā)表于 2025-3-22 23:36:59 | 只看該作者
9#
發(fā)表于 2025-3-23 03:32:57 | 只看該作者
10#
發(fā)表于 2025-3-23 08:26:46 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-31 02:25
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
陆河县| 大兴区| 玉山县| 宜城市| 万盛区| 合肥市| 利津县| 桃园县| 泾源县| 辽宁省| 临洮县| 虞城县| 高密市| 郓城县| 红原县| 黄陵县| 江口县| 康乐县| 临江市| 周至县| 临猗县| 辉县市| 岑巩县| 若尔盖县| 新蔡县| 卓资县| 泗洪县| 岳阳市| 托克逊县| 兴海县| 新津县| 金寨县| 金坛市| 沛县| 辽中县| 报价| 肥西县| 逊克县| 松原市| 牟定县| 铅山县|