Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th SCN 2020: Amalfi, Italy
- Clemente Galdi
, Vladimir Kolesnikov:
Security and Cryptography for Networks - 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings. Lecture Notes in Computer Science 12238, Springer 2020, ISBN 978-3-030-57989-0
Blockchain
- Dimitris Karakostas, Aggelos Kiayias, Mario Larangeira:
Account Management in Proof of Stake Ledgers. 3-23 - Thomas Dinsdale-Young, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi:
Afgjort: A Partially Synchronous Finality Layer for Blockchains. 24-44 - Alin Tomescu, Ittai Abraham, Vitalik Buterin, Justin Drake, Dankrad Feist, Dmitry Khovratovich:
Aggregatable Subvector Commitments for Stateless Cryptocurrencies. 45-64 - Nico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan:
Tight Verifiable Delay Functions. 65-84
Multiparty Computation
- Sanjam Garg, Xiao Liang, Omkant Pandey, Ivan Visconti:
Black-Box Constructions of Bounded-Concurrent Secure Computation. 87-107 - Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky, Moti Yung:
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups. 108-129 - Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza:
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE. 130-149 - Rishabh Bhadauria, Carmit Hazay:
Multi-clients Verifiable Computation via Conditional Disclosure of Secrets. 150-171 - Ben Kreuter, Sarvar Patel, Ben Terner:
Private Identity Agreement for Private Set Functionalities. 172-191 - Willy Quach:
UC-Secure OT from LWE, Revisited. 192-211
Oblivious RAM
- Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. 215-232 - Carmit Hazay, Mor Lilintal:
Gradual GRAM and Secure Computation for RAM Programs. 233-252 - Samuel Dittmer, Rafail Ostrovsky:
Oblivious Tight Compaction In O(n) Time with Smaller Constant. 253-274
Primitives and Constructions
- Lydia Garms, Siaw-Lynn Ng, Elizabeth A. Quaglia, Giulia Traverso:
Anonymity and Rewards in Peer Rating Systems. 277-297 - Daniel E. Lucani, Lars Nielsen, Claudio Orlandi, Elena Pagnin, Rasmus Vestergaard:
Secure Generalized Deduplication via Multi-Key Revealing Encryption. 298-318
Signatures, Encryption, and Algebraic Constructions
- Xavier Boyen, Malika Izabachène, Qinyi Li:
A Simple and Efficient CCA-Secure Lattice KEM in the Standard Model. 321-337 - Dario Catalano, Georg Fuchsbauer, Azam Soleimanian:
Double-Authentication-Preventing Signatures in the Standard Model. 338-358 - Balthazar Bauer, Georg Fuchsbauer:
Efficient Signatures on Randomizable Ciphertexts. 359-381 - Ivan Damgård, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergård:
Fast Threshold ECDSA with Honest Majority. 382-400 - Jan Camenisch, Manu Drijvers, Anja Lehmann, Gregory Neven, Patrick Towa:
Short Threshold Dynamic Group Signatures. 401-423
Symmetric Crypto
- David Derler, Stephan Krenn, Kai Samelin, Daniel Slamanig:
Fully Collision-Resistant Chameleon-Hashes from Simpler and Post-quantum Assumptions. 427-447 - Tomer Ashur, Raluca Posteuca, Danilo Sijacic, Stef D'haeseleer:
Generalized Matsui Algorithm 1 with Application for the Full DES. 448-467
Theory and Lower Bounds
- Fabio Banfi, Ueli Maurer:
Anonymous Symmetric-Key Communication. 471-491 - Marc Abboud, Thomas Prest:
Cryptographic Divergences: New Techniques and New Applications. 492-511 - Cody Freitag, Ilan Komargodski, Rafael Pass:
Impossibility of Strong KDM Security with Auxiliary Input. 512-524 - Michel Abdalla, Florian Bourse, Hugo Marival, David Pointcheval, Azam Soleimanian, Hendrik Waldner:
Multi-Client Inner-Product Functional Encryption in the Random-Oracle Model. 525-545 - Pratik Soni, Stefano Tessaro:
On the Query Complexity of Constructing PRFs from Non-adaptive PRFs. 546-565 - Kasper Green Larsen, Mark Simkin:
Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long. 566-578 - Julia Hesse:
Separating Symmetric and Asymmetric Password-Authenticated Key Exchange. 579-599 - Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain:
The Round Complexity of Secure Computation Against Covert Adversaries. 600-620 - Rafael Pass:
Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit. 621-642
Zero-Knowledge
- Helger Lipmaa:
Key-and-Argument-Updatable QA-NIZKs. 645-669 - Michele Ciampi, Roberto Parisella, Daniele Venturi:
On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs. 670-690
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-08-17 23:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
