Security and cryptography for networks : 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings

Bibliographische Detailangaben

Titel
Security and cryptography for networks 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings
verantwortlich
Galdi, Clemente.; Kolesnikov, Vladimir.
Schriftenreihe
Lecture Notes in Computer Science ; ; 12238
veröffentlicht
Cham, Switzerland: Springer, [2020]
Erscheinungsjahr
2020
Teil von
Lecture notes in computer science.
Medientyp
E-Book
Datenquelle
British Library Catalogue
Tags
Tag hinzufügen

Zugang

Für diesen Titel können wir derzeit leider keine weiteren Informationen zur Verfügbarkeit bereitstellen.

LEADER 04629aam a22004811i 4500
001 181-019934056
003 Uk
005 20201130182153.0
006 m || d |
007 cr |||||||||||
008 200919s2020 sz o ||| 0 eng d
015 |a GBC0F7706  |2 bnb 
020 |a 9783030579906  |q electronic book 
020 |a 3030579905  |q electronic book 
037 |a com.springer.onix.9783030579906  |b Springer Nature 
040 |a EBLCP  |b eng  |c EBLCP  |d LQU  |d YDXIT  |d OCLCO  |d Uk  |e rda 
042 |a ukblsr 
050 4 |a QA76.9.A25  |b G35 2020 
082 0 4 |a 005.8/24  |2 23 
100 1 |a Galdi, Clemente. 
245 1 0 |a Security and cryptography for networks  |b 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings 
264 1 |a Cham, Switzerland  |b Springer  |c [2020] 
300 |a 1 online resource. 
336 |a text  |2 rdacontent 
337 |a computer  |2 rdamedia 
338 |a online resource  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science ;  |v 12238 
500 |a 2.2 Roadblocks Facing PMPC for Dynamic General Adversary Structures and Dynamic Groups 
504 |a References -- Tight Verifiable Delay Functions -- 1 Introduction -- 1.1 Our Techniques -- 1.2 Related Work -- 2 Verifiable Delay Functions -- 3 A Bootstrapping Theorem for VDFs -- 3.1 Building Block -- 3.2 Scheme Description -- 3.3 Analysis -- 4 Black-Box Impossibility -- A Instantiations -- A.1 Compute-and-Prove VDF -- A.2 Wesolowski's VDF -- A.3 Pietrzak's VDF -- References -- Multiparty Computation -- Black-Box Constructions of Bounded-Concurrent Secure Computation -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Other Related Works -- 2 Overview of Our Techniques 
505 0 |a Intro -- Preface -- Organization -- Contents -- Blockchain -- Account Management in Proof of Stake Ledgers -- 1 Introduction -- 1.1 Our Contributions and Roadmap -- 1.2 Related Work -- 1.3 Preliminaries -- 2 General Desiderata -- 3 Address Malleability -- 4 The Core Proof-of-Stake Wallet -- 4.1 The Core-Wallet Functionality -- 4.2 The Core-Wallet Protocol -- 4.3 Security of the Core-Wallet Protocol -- 4.4 Address Construction and Wallet Recovery -- 5 Integration of the Core-Wallet with PoS Consensus -- 5.1 The PoS Wallet's Actions -- 5.2 Participation in the PoS Protocol 
505 8 |a 5.3 Consensus Security Under Stake Pools -- 5.4 Attacks Against Stake Pooled PoS -- References -- Afgjort: A Partially Synchronous Finality Layer for Blockchains -- 1 Introduction -- 1.1 Our Contributions -- 1.2 The Two-Layer Approach -- 1.3 Our Techniques -- 1.4 Related Work -- 2 Preliminaries -- 2.1 Model and Network Assumptions -- 3 Abstract Model of Blockchains -- 3.1 Desirable Properties and Bounds -- 3.2 Discussion on Dishonest Chain Growth -- 4 The Finality Layer -- 4.1 Formalization -- 5 Afgjort Protocol -- 6 Weak Multi-valued Byzantine Agreement -- 7 Experimental Results -- References 
505 8 |a Aggregatable Subvector Commitments for Stateless Cryptocurrencies -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 2.1 KZG Polynomial Commitments -- 2.2 Account-Based Stateless Cryptocurrencies -- 3 Aggregatable Subvector Commitment (aSVC) Schemes -- 3.1 aSVC API -- 3.2 aSVC Correctness and Security Definitions -- 3.3 aSVC from KZG Commitments to Lagrange Polynomials -- 3.4 Partial Fraction Decomposition -- 4 A Highly-Efficient Stateless Cryptocurrency -- 4.1 From VCs to Stateless Cryptocurrencies -- 4.2 Efficient Stateless Cryptocurrencies from aSVCs -- 4.3 Discussion -- 5 Conclusion 
505 8 |a 2.1 Black-Box (Constant-Round) Bounded-Concurrent OT -- 2.2 Composition of OT with OT-hybrid MPC -- 3 Preliminaries -- 4 Robust Zero-Knowledge and Commit-and-Prove -- 5 Straight-Line Extractable Commitments -- 6 Our Bounded Concurrent OT Protocol -- 7 Our Bounded-Concurrent MPC Protocol -- References -- Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups -- 1 Introduction -- 2 Overview of Proactive MPC and Design Roadblocks -- 2.1 Blueprint of Proactive Secret Sharing (PSS) and Proactive MPC (PMPC) 
650 0 |a Data encryption (Computer science) 
655 0 |a Electronic books. 
700 1 |a Kolesnikov, Vladimir. 
830 0 |a Lecture notes in computer science. 
859 |a ELD  |b ebook 
884 |a LDL ebooks ONIX to marcxml transformation using Record_Load-eBooks_Legal_Deposit_onix2marc_v2-1.xsl  |g 20200910  |k com.springer.onix.9783030579906  |q Uk 
889 |a (OCoLC)1195449316 
852 |a British Library  |b HMNTS  |c DRT  |j ELD.DS.550483 
903 |a ELD.DS.550483 
980 |a 019934056  |b 181  |c sid-181-col-blfidbbi 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fkatalog.fid-bbi.de%3Agenerator&rft.title=Security+and+cryptography+for+networks%3A+12th+International+Conference%2C+SCN+2020%2C+Amalfi%2C+Italy%2C+September+14-16%2C+2020%2C+Proceedings&rft.date=%5B2020%5D&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Security+and+cryptography+for+networks%3A+12th+International+Conference%2C+SCN+2020%2C+Amalfi%2C+Italy%2C+September+14-16%2C+2020%2C+Proceedings&rft.series=Lecture+notes+in+computer+science&rft.au=Galdi%2C+Clemente.&rft.pub=Springer&rft.edition=&rft.isbn=3030579905
SOLR
_version_ 1778756024916770816
access_facet Electronic Resources
author Galdi, Clemente.
author2 Kolesnikov, Vladimir.
author2_role
author2_variant v k vk
author_facet Galdi, Clemente., Kolesnikov, Vladimir.
author_role
author_sort Galdi, Clemente.
author_variant c g cg
building Library A
callnumber-first Q - Science
callnumber-label QA76
callnumber-raw QA76.9.A25 G35 2020
callnumber-search QA76.9.A25 G35 2020
callnumber-sort QA 276.9 A25 G35 42020
callnumber-subject QA - Mathematics
collection sid-181-col-blfidbbi
contents Intro -- Preface -- Organization -- Contents -- Blockchain -- Account Management in Proof of Stake Ledgers -- 1 Introduction -- 1.1 Our Contributions and Roadmap -- 1.2 Related Work -- 1.3 Preliminaries -- 2 General Desiderata -- 3 Address Malleability -- 4 The Core Proof-of-Stake Wallet -- 4.1 The Core-Wallet Functionality -- 4.2 The Core-Wallet Protocol -- 4.3 Security of the Core-Wallet Protocol -- 4.4 Address Construction and Wallet Recovery -- 5 Integration of the Core-Wallet with PoS Consensus -- 5.1 The PoS Wallet's Actions -- 5.2 Participation in the PoS Protocol, 5.3 Consensus Security Under Stake Pools -- 5.4 Attacks Against Stake Pooled PoS -- References -- Afgjort: A Partially Synchronous Finality Layer for Blockchains -- 1 Introduction -- 1.1 Our Contributions -- 1.2 The Two-Layer Approach -- 1.3 Our Techniques -- 1.4 Related Work -- 2 Preliminaries -- 2.1 Model and Network Assumptions -- 3 Abstract Model of Blockchains -- 3.1 Desirable Properties and Bounds -- 3.2 Discussion on Dishonest Chain Growth -- 4 The Finality Layer -- 4.1 Formalization -- 5 Afgjort Protocol -- 6 Weak Multi-valued Byzantine Agreement -- 7 Experimental Results -- References, Aggregatable Subvector Commitments for Stateless Cryptocurrencies -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 2.1 KZG Polynomial Commitments -- 2.2 Account-Based Stateless Cryptocurrencies -- 3 Aggregatable Subvector Commitment (aSVC) Schemes -- 3.1 aSVC API -- 3.2 aSVC Correctness and Security Definitions -- 3.3 aSVC from KZG Commitments to Lagrange Polynomials -- 3.4 Partial Fraction Decomposition -- 4 A Highly-Efficient Stateless Cryptocurrency -- 4.1 From VCs to Stateless Cryptocurrencies -- 4.2 Efficient Stateless Cryptocurrencies from aSVCs -- 4.3 Discussion -- 5 Conclusion, 2.1 Black-Box (Constant-Round) Bounded-Concurrent OT -- 2.2 Composition of OT with OT-hybrid MPC -- 3 Preliminaries -- 4 Robust Zero-Knowledge and Commit-and-Prove -- 5 Straight-Line Extractable Commitments -- 6 Our Bounded Concurrent OT Protocol -- 7 Our Bounded-Concurrent MPC Protocol -- References -- Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups -- 1 Introduction -- 2 Overview of Proactive MPC and Design Roadblocks -- 2.1 Blueprint of Proactive Secret Sharing (PSS) and Proactive MPC (PMPC)
dewey-full 005.8/24
dewey-hundreds 000 - Computer science, information & general works
dewey-ones 005 - Computer programming, programs & data
dewey-raw 005.8/24
dewey-search 005.8/24
dewey-sort 15.8 224
dewey-tens 000 - Computer science, knowledge & systems
facet_avail Online
finc_class_facet Informatik, Mathematik
fincclass_txtF_mv science-computerscience
footnote 2.2 Roadblocks Facing PMPC for Dynamic General Adversary Structures and Dynamic Groups
format eBook
format_access_txtF_mv Book, E-Book
format_de105 Ebook
format_de14 Book, E-Book
format_de15 Book, E-Book
format_del152 Buch
format_detail_txtF_mv text-online-monograph-independent
format_dezi4 e-Book
format_finc Book, E-Book
format_legacy ElectronicBook
format_legacy_nrw Book, E-Book
format_nrw Book, E-Book
format_strict_txtF_mv E-Book
genre Electronic books.
genre_facet Electronic books.
geogr_code not assigned
geogr_code_person not assigned
id 181-019934056
illustrated Not Illustrated
imprint Cham, Switzerland, Springer, [2020]
imprint_str_mv Cham, Switzerland Springer [2020]
institution FID-BBI-DE-23
is_hierarchy_id
is_hierarchy_title
isbn 9783030579906, 3030579905
isil_str_mv FID-BBI-DE-23
language English
last_indexed 2023-10-03T17:25:35.526Z
match_str galdi2020securityandcryptographyfornetworks12thinternationalconferencescn2020amalfiitalyseptember14162020proceedings
mega_collection British Library Catalogue
physical 1 online resource
publishDate [2020]
publishDateSort 2020
publishPlace Cham, Switzerland
publisher Springer
record_format marcfinc
record_id 019934056
recordtype marcfinc
rvk_facet No subject assigned
series Lecture notes in computer science
series2 Lecture Notes in Computer Science ; 12238
source_id 181
spelling Galdi, Clemente., Security and cryptography for networks 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings, Cham, Switzerland Springer [2020], 1 online resource., text rdacontent, computer rdamedia, online resource rdacarrier, Lecture Notes in Computer Science ; 12238, 2.2 Roadblocks Facing PMPC for Dynamic General Adversary Structures and Dynamic Groups, References -- Tight Verifiable Delay Functions -- 1 Introduction -- 1.1 Our Techniques -- 1.2 Related Work -- 2 Verifiable Delay Functions -- 3 A Bootstrapping Theorem for VDFs -- 3.1 Building Block -- 3.2 Scheme Description -- 3.3 Analysis -- 4 Black-Box Impossibility -- A Instantiations -- A.1 Compute-and-Prove VDF -- A.2 Wesolowski's VDF -- A.3 Pietrzak's VDF -- References -- Multiparty Computation -- Black-Box Constructions of Bounded-Concurrent Secure Computation -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Other Related Works -- 2 Overview of Our Techniques, Intro -- Preface -- Organization -- Contents -- Blockchain -- Account Management in Proof of Stake Ledgers -- 1 Introduction -- 1.1 Our Contributions and Roadmap -- 1.2 Related Work -- 1.3 Preliminaries -- 2 General Desiderata -- 3 Address Malleability -- 4 The Core Proof-of-Stake Wallet -- 4.1 The Core-Wallet Functionality -- 4.2 The Core-Wallet Protocol -- 4.3 Security of the Core-Wallet Protocol -- 4.4 Address Construction and Wallet Recovery -- 5 Integration of the Core-Wallet with PoS Consensus -- 5.1 The PoS Wallet's Actions -- 5.2 Participation in the PoS Protocol, 5.3 Consensus Security Under Stake Pools -- 5.4 Attacks Against Stake Pooled PoS -- References -- Afgjort: A Partially Synchronous Finality Layer for Blockchains -- 1 Introduction -- 1.1 Our Contributions -- 1.2 The Two-Layer Approach -- 1.3 Our Techniques -- 1.4 Related Work -- 2 Preliminaries -- 2.1 Model and Network Assumptions -- 3 Abstract Model of Blockchains -- 3.1 Desirable Properties and Bounds -- 3.2 Discussion on Dishonest Chain Growth -- 4 The Finality Layer -- 4.1 Formalization -- 5 Afgjort Protocol -- 6 Weak Multi-valued Byzantine Agreement -- 7 Experimental Results -- References, Aggregatable Subvector Commitments for Stateless Cryptocurrencies -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 2.1 KZG Polynomial Commitments -- 2.2 Account-Based Stateless Cryptocurrencies -- 3 Aggregatable Subvector Commitment (aSVC) Schemes -- 3.1 aSVC API -- 3.2 aSVC Correctness and Security Definitions -- 3.3 aSVC from KZG Commitments to Lagrange Polynomials -- 3.4 Partial Fraction Decomposition -- 4 A Highly-Efficient Stateless Cryptocurrency -- 4.1 From VCs to Stateless Cryptocurrencies -- 4.2 Efficient Stateless Cryptocurrencies from aSVCs -- 4.3 Discussion -- 5 Conclusion, 2.1 Black-Box (Constant-Round) Bounded-Concurrent OT -- 2.2 Composition of OT with OT-hybrid MPC -- 3 Preliminaries -- 4 Robust Zero-Knowledge and Commit-and-Prove -- 5 Straight-Line Extractable Commitments -- 6 Our Bounded Concurrent OT Protocol -- 7 Our Bounded-Concurrent MPC Protocol -- References -- Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups -- 1 Introduction -- 2 Overview of Proactive MPC and Design Roadblocks -- 2.1 Blueprint of Proactive Secret Sharing (PSS) and Proactive MPC (PMPC), Data encryption (Computer science), Electronic books., Kolesnikov, Vladimir., Lecture notes in computer science., ELD ebook, LDL ebooks ONIX to marcxml transformation using Record_Load-eBooks_Legal_Deposit_onix2marc_v2-1.xsl 20200910 com.springer.onix.9783030579906 Uk, (OCoLC)1195449316, British Library HMNTS DRT ELD.DS.550483
spellingShingle Galdi, Clemente., Security and cryptography for networks: 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings, Lecture notes in computer science, Intro -- Preface -- Organization -- Contents -- Blockchain -- Account Management in Proof of Stake Ledgers -- 1 Introduction -- 1.1 Our Contributions and Roadmap -- 1.2 Related Work -- 1.3 Preliminaries -- 2 General Desiderata -- 3 Address Malleability -- 4 The Core Proof-of-Stake Wallet -- 4.1 The Core-Wallet Functionality -- 4.2 The Core-Wallet Protocol -- 4.3 Security of the Core-Wallet Protocol -- 4.4 Address Construction and Wallet Recovery -- 5 Integration of the Core-Wallet with PoS Consensus -- 5.1 The PoS Wallet's Actions -- 5.2 Participation in the PoS Protocol, 5.3 Consensus Security Under Stake Pools -- 5.4 Attacks Against Stake Pooled PoS -- References -- Afgjort: A Partially Synchronous Finality Layer for Blockchains -- 1 Introduction -- 1.1 Our Contributions -- 1.2 The Two-Layer Approach -- 1.3 Our Techniques -- 1.4 Related Work -- 2 Preliminaries -- 2.1 Model and Network Assumptions -- 3 Abstract Model of Blockchains -- 3.1 Desirable Properties and Bounds -- 3.2 Discussion on Dishonest Chain Growth -- 4 The Finality Layer -- 4.1 Formalization -- 5 Afgjort Protocol -- 6 Weak Multi-valued Byzantine Agreement -- 7 Experimental Results -- References, Aggregatable Subvector Commitments for Stateless Cryptocurrencies -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 2.1 KZG Polynomial Commitments -- 2.2 Account-Based Stateless Cryptocurrencies -- 3 Aggregatable Subvector Commitment (aSVC) Schemes -- 3.1 aSVC API -- 3.2 aSVC Correctness and Security Definitions -- 3.3 aSVC from KZG Commitments to Lagrange Polynomials -- 3.4 Partial Fraction Decomposition -- 4 A Highly-Efficient Stateless Cryptocurrency -- 4.1 From VCs to Stateless Cryptocurrencies -- 4.2 Efficient Stateless Cryptocurrencies from aSVCs -- 4.3 Discussion -- 5 Conclusion, 2.1 Black-Box (Constant-Round) Bounded-Concurrent OT -- 2.2 Composition of OT with OT-hybrid MPC -- 3 Preliminaries -- 4 Robust Zero-Knowledge and Commit-and-Prove -- 5 Straight-Line Extractable Commitments -- 6 Our Bounded Concurrent OT Protocol -- 7 Our Bounded-Concurrent MPC Protocol -- References -- Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups -- 1 Introduction -- 2 Overview of Proactive MPC and Design Roadblocks -- 2.1 Blueprint of Proactive Secret Sharing (PSS) and Proactive MPC (PMPC), Data encryption (Computer science), Electronic books.
title Security and cryptography for networks: 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings
title_auth Security and cryptography for networks 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings
title_full Security and cryptography for networks 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings
title_fullStr Security and cryptography for networks 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings
title_full_unstemmed Security and cryptography for networks 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings
title_in_hierarchy Security and cryptography for networks: 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings ([2020])
title_short Security and cryptography for networks
title_sort security and cryptography for networks 12th international conference scn 2020 amalfi italy september 14 16 2020 proceedings
title_sub 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings
topic Data encryption (Computer science), Electronic books.
topic_facet Data encryption (Computer science), Electronic books.