دانلود کتاب خارجی - دانلود رایگان کتاب لاتین PDF علمی

تعداد نتایج: 802

Foundations of Security Analysis and Design VIII

FOSAD 2014/2015/2016 Tutorial Lectures

By Alessandro Aldini, Javier Lopez, Fabio Martinelli
Publisher: Springer, 2016-08-15
Pages: 170
Language: en
ISBN_13:9783319430058
ISBN_10:331943005X
Subject: Computers

Foundations of Software Science and Computation Structures

23rd International Conference, FOSSACS 2020, Held as Part of...

جزئیات و درخواست

By Jean Goubault-Larrecq, Barbara König
Publisher: Springer Nature, 2020-04-17
Pages: 644
Language: en
ISBN_13:9783030452315
ISBN_10:303045231X
Subject: Mathematics

Integration of Cloud Computing with Internet of Things

Foundations, Analytics and Applications

جزئیات و درخواست

By Monika Mangla, Suneeta Satpathy, Bhagirathi Nayak, Sachi Nandan Mohanty
Publisher: John Wiley & Sons, 2021-04-13
Pages: 386
Language: en
ISBN_13:9781119768876
ISBN_10:111976887X
Subject: Computers

Foundations and Practice of Security

9th International Symposium, FPS 2016, Québec City, QC, Cana...

جزئیات و درخواست

By Frédéric Cuppens, Lingyu Wang, Nora Cuppens-Boulahia, Nadia Tawbi, Joaquin Garcia-Alfaro
Publisher: Springer, 2016-12-28
Pages: 361
Language: en
ISBN_13:9783319519661
ISBN_10:3319519662
Subject: Computers

Foundations and Practice of Security

7th International Symposium, FPS 2014, Montreal, QC, Canada,...

جزئیات و درخواست

By Frédéric Cuppens, Joaquin Garcia-Alfaro, Nur Zincir Heywood, Philip W. L. Fong
Publisher: Springer, 2015-04-04
Pages: 376
Language: en
ISBN_13:9783319170404
ISBN_10:3319170406
Subject: Computers

Foundations of Cryptography: Volume 1, Basic Tools

جزئیات و درخواست

By Oded Goldreich
Publisher: Cambridge University Press, 2001-08-06
Pages: 392
Language: en
ISBN_10:0521791723
ISBN_13:9780521791724
Subject: Computers

Advances in Cryptology – EUROCRYPT 2020

39th Annual International Conference on the Theory and Appli...

جزئیات و درخواست

By Anne Canteaut, Yuval Ishai
Publisher: Springer Nature, 2020-05-01
Pages: 805
Language: en
ISBN_13:9783030457211
ISBN_10:3030457214
Subject: Computers

Fundamentals Of Computer Security

جزئیات و درخواست

By Pieprzyk
2007-12-01
Pages: 678
Language: en
ISBN_10:8181289161
ISBN_13:9788181289162

Cloud Computing Security

Foundations and Research Directions

جزئیات و درخواست

By Anrin Chakraborti, Reza Curtmola, Jonathan Katz
2022-02-22
Pages: 128
Language: en
ISBN_10:1680839586
ISBN_13:9781680839586

Foundations of Cryptography

جزئیات و درخواست

By Oded Goldreich
2001
Language: en
OTHER:OCLC:1137348782

Secure Computation in the Preprocessing Model

جزئیات و درخواست

By Sarah N. H. Zakarias
2014
Pages: 186
Language: en
OTHER:OCLC:900185420

Advances in Cryptology – CRYPTO 2018

38th Annual International Cryptology Conference, Santa Barba...

جزئیات و درخواست

By Hovav Shacham, Alexandra Boldyreva
Publisher: Springer, 2018-08-11
Pages: 788
Language: en
ISBN_13:9783319968780
ISBN_10:3319968785
Subject: Computers

Practical and Foundational Aspects of Secure Computation

جزئیات و درخواست

By Samuel Ranellucci
2014
Language: en
OTHER:OCLC:1032927659

Towards Optimality in Secure Computation

$The need for Cryptography arises out of the following fundamental question: can we perform useful computation while ensuring that an adversary does not learn anything about our private sensitive data? The notion of secure multiparty computation (MPC) \cite{Yao82,GMW87} is a unifying framework for general secure protocols. MPC allows mutually distrusting parties to jointly evaluate any efficiently computable function on their private inputs in such a manner that each party does not learn anything beyond the output of the function. In this thesis, we study the question of building MPC protocols in various security models from standard cryptographic assumptions while minimizing the number of rounds of interaction amongst parties. In the first part of this thesis, (in a joint work with Vipul Goyal, Abhishek Jain, Yael Kalai, Dakshita Khurana and Amit Sahai, CRYPTO 2018) we construct the first round-optimal (i.e., four round) MPC protocol for general functions based on polynomially hard DDH (or QR or N$^{th}$-Residuosity) in the plain model where parties have access to no trusted setup. We further show how to overcome the four-round barrier for MPC by constructing a three-round protocol for ``list coin-tossing'' -- a slight relaxation of coin-tossing that suffices for most conceivable applications -- based on polynomially hard DDH (or QR or N$^{th}$-Residuosity). This result generalizes to randomized input-less functionalities. Previously, four round MPC protocols required sub-exponential-time hardness assumptions and no multi-party three-round protocols were known for any relaxed security notions with polynomial-time simulation against malicious adversaries. In order to build these protocols, we devise a new {\em partitioned simulation} technique for MPC where the simulator uses different strategies for simulating the view of aborting adversaries and non-aborting adversaries. The protagonist of this technique is a new notion of {\em promise zero knowledge} (ZK) where the ZK property only holds against non-aborting verifiers. We show how to realize promise ZK in three rounds in the simultaneous-message model assuming polynomially hard DDH (or QR or N$^{th}$-Residuosity). We also rely upon a new {\em leveled rewinding security} technique that can be viewed as a polynomial-time alternative to leveled complexity leveraging for achieving ``non-malleability'' across different primitives. Then, we also we study the round complexity of concurrently secure multi-party computation (MPC) with super-polynomial simulation (SPS) in the plain model (in a joint work with Vipul Goyal, Abhishek Jain, Dakshita Khurana and Amit Sahai, TCC 2017). In the plain model, there are known explicit attacks that show that concurrently secure MPC with polynomial simulation is impossible to achieve; SPS security is the most widely studied model for concurrently secure MPC in the plain model. We construct a three-round concurrent MPC with SPS security against Byzantine adversaries, assuming sub-exponentially secure DDH and LWE. Prior to our work, the best known round complexity for SPS concurrent MPC was around twenty, although to the best of our knowledge, no previous work even gave an approximation of the constant round complexity that is sufficient for concurrent MPC. In the second part of the thesis, (in a joint work with Abhishek Jain, Rafail Ostrovsky and Ivan Visconti, ASIACRYPT 2018), we study the problem of non-interactive secure computation in the stateless hardware token model where parties have access to physical hardware as part of a trusted setup phase. The notion of non-interactive secure computation (NISC) first introduced in the work of Ishai et al. [EUROCRYPT 2011] studies the following problem: Suppose a receiver $R$ wishes to publish an encryption of her secret input $y$ so that any sender $S$ with input $x$ can then send a message $m$ that reveals $f(x,y)$ to $R$ (for some function $f$). Here, $m$ can be viewed as an encryption of $f(x,y)$ that can be decrypted by $R$. NISC requires security against both malicious senders and receivers, and also requires the receiver's message to be reusable across multiple computations (w.r.t. a fixed input of the receiver). All previous solutions to this problem necessarily rely upon OT (or specific number-theoretic assumptions) even in the common reference string model or the random oracle model or to achieve weaker notions of security such as super-polynomial-time simulation. In this work, we construct a NISC protocol based on the minimal assumption of one way functions, in the stateless hardware token model. Our construction achieves UC security and requires a single token sent by the receiver to the sender.$

جزئیات و درخواست

By Saikrishna Badrinarayanan
2019
Pages: 202
Language: en
OTHER:OCLC:1114620986

Federated Learning

Fundamentals and Advances

جزئیات و درخواست

By Yaochu Jin, Hangyu Zhu, Jinjin Xu, Yang Chen
Publisher: Springer Nature, 2022-11-29
Pages: 227
Language: en
ISBN_13:9789811970832
ISBN_10:9811970831
Subject: Computers

Cloud Computing for Optimization: Foundations, Applications, and Challenges

جزئیات و درخواست

By Bhabani Shankar Prasad Mishra, Himansu Das, Satchidananda Dehuri, Alok Kumar Jagadev
Publisher: Springer, 2018-02-26
Pages: 468
Language: en
ISBN_13:9783319736761
ISBN_10:3319736760
Subject: Technology & Engineering

Simple Steps to Data Encryption

A Practical Guide to Secure Computing

جزئیات و درخواست

By Peter Loshin
Publisher: Newnes, 2013-04-30
Pages: 114
Language: en
ISBN_13:9780124078826
ISBN_10:0124078826
Subject: Computers

Guide to Computer Network Security

جزئیات و درخواست

By Joseph Migga Kizza
Publisher: Springer Nature, 2020-06-03
Pages: 599
Language: en
ISBN_13:9783030381417
ISBN_10:3030381412
Subject: Computers

Secure Computation in Untrusted Environments

جزئیات و درخواست

By Claudio Orlandi
2011
Pages: 130
Language: en
OTHER:OCLC:794262883

Security and Embedded Systems

جزئیات و درخواست

By R. Giladi, D.N. Serpanos
Publisher: IOS Press, 2006-01-12
Pages: 216
Language: en
ISBN_13:9781607501558
ISBN_10:1607501554
Subject: Computers

«1 2 3 4 5 6 7 8 9 10 »

سایت دانلود کتاب خارجی

نحوه دانلود و خرید کتاب های خارجی

ابتدا در قسمت جستجوی سایت، کلمه کلیدی مد نظر خود را وارد کنید، سپس فیلتر مد نظر خود را انتخاب کنید که در کدام مشخصه کتاب جستجو انجام شود. پس از انتخاب فیلتر مدنظر خود (نویسنده، ناشر، شناسه ISBN، موضوع و یاهمه قسمت ها دکمه جستجو را بزنید. در نتایج می توانید کتاب خارجی مد نظر خود را انتخاب کنید و سپس درخواست خود را برای خرید کتاب خارجی ثبت کنید.

جستجو و دانلود کتاب لاتین

برای دانلود کتاب های لاتین ابتدا کلمه کلیدی خود را داخل کادر جستجو وارد کنید و سپس زبان مربوطه را انتخاب کنید (انگلیسی، اسپانیایی، فرانسوی، آلمانی و ...) و در نهایت دکمه جستجو را بزنید. از نتایج جستجو کتاب لاتین مد نظر خود را انتخاب کنید و سپس درخواست آن را ثبت کنید. همکاران ما در کمتر چند ساعت درخواست شما را بررسی و قیمت گذاری می کنند.

خرید کتاب از آمازون

چاپ کتاب زبان اصلی

دانلود کتاب از آمازون

خرید کتاب از گوگل بوکز

خرید کتاب زبان اصلی

سایت خرید کتاب زبان اصلی

نحوه ثبت درخواست دانلود کتاب لاتین

پس از جستجو و یافتن کتاب و یا منابع لاتین، روی تصویر کتاب و یا دکمه درخواست کلیک کنید و سپس در صفحه ثبت درخواست، مشخصات کامل درخواست خود را بررسی و ایمیل و شماره تماس خود را وارد کنید. در نهایت همکاران ما هزینه و مدت زمان تهیه کتاب خارجی شما را بررسی و از طریق پیامک و ایمیل به شما اطلاع رسانی خواهند کرد. شما پس از پرداخت وجه روی لینک دانلود کتاب لاتین کلیک کنید و کتاب خود را دانلود و استفاده کنید.

کتاب زبان اصلی J.R.R

دانلود کتاب لاتین

خرید کتاب لاتین

خرید مانگا

خرید کتاب از گوگل بوکز

دانلود رایگان کتاب از گوگل بوکز

دانلود رایگان کتاب از آمازون

دانلود رایگان کتاب از گوگل بوکز

کتاب روانشناسی به انگلیسی

کتاب زبان اصلی

کتاب خارجی

سایت خرید کتاب زبان اصلی