default search action
12th SCN 2022: Amalfi, Italy
- Clemente Galdi, Stanislaw Jarecki:
Security and Cryptography for Networks - 13th International Conference, SCN 2022, Amalfi, Italy, September 12-14, 2022, Proceedings. Lecture Notes in Computer Science 13409, Springer 2022, ISBN 978-3-031-14790-6
Ciphers, Cryptanalysis, Defenses
- Elena Kirshanova, Alexander May:
Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything. 3-20 - Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri:
Cost-Asymmetric Memory Hard Password Hashing. 21-44 - Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki:
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. 45-68 - Raluca Posteuca, Vincent Rijmen:
RAMus- A New Lightweight Block Cipher for RAM Encryption. 69-92 - Suparna Kundu, Jan-Pieter D'Anvers, Michiel Van Beirendonck, Angshuman Karmakar, Ingrid Verbauwhede:
Higher-Order Masked Saber. 93-116 - Georg Fuchsbauer, Riddhi Ghosal, Nathan Hauke, Adam O'Neill:
Approximate Distance-Comparison-Preserving Symmetric Encryption. 117-144
Public Key Encryption
- Cécile Delerablée, Lénaïck Gouriou, David Pointcheval:
Key-Policy ABE with Switchable Attributes. 147-171 - Antonio Faonio, Luigi Russo:
Mix-Nets from Re-randomizable and Replayable CCA-Secure Public-Key Encryption. 172-196 - Benoît Libert, Alain Passelègue, Mahshid Riahinia:
New and Improved Constructions for Partially Equivocable Public Key Encryption. 197-219 - Cecilia Boschini, Ivan Damgård, Claudio Orlandi:
On Access Control Encryption Without Sanitization. 220-243 - Foteini Baldimtsi, Aggelos Kiayias, Katerina Samari:
Watermarkable Public Key Encryption with Efficient Extraction Under Standard Assumptions. 244-267
Authentication and Signatures
- Jonathan Katz:
A Provably Secure, Lightweight Protocol for Anonymous Authentication. 271-288 - Fabio Banfi, Ueli Maurer:
Anonymous Authenticated Communication. 289-312 - Melissa Chase, Georg Fuchsbauer, Esha Ghosh, Antoine Plouviez:
Credential Transparency System. 313-335 - Benoît Libert, Ky Nguyen, Alain Passelègue:
Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions. 336-361 - Sebastian Faust, Juliane Krämer, Maximilian Orlt, Patrick Struck:
On the Related-Key Attack Security of Authenticated Encryption Schemes. 362-386 - Diego F. Aranha, Felix Engelmann, Sebastian Kolby, Sophia Yakoubov:
The State of the Union: Union-Only Signatures for Data Aggregation. 387-410 - Chloé Hébant, David Pointcheval:
Traceable Constant-Size Multi-authority Credentials. 411-434
Multiparty Computation
- Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
3-Party Distributed ORAM from Oblivious Set Membership. 437-461 - Tyler Beauregard, Janabel Xia, Mike Rosulek:
Finding One Common Item, Privately. 462-480 - Sina Shiehian:
mrNISC from LWE with Polynomial Modulus. 481-493 - Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov:
On Sufficient Oracles for Secure Computation with Identifiable Abort. 494-515 - Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou:
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares. 516-539 - Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen:
Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. 540-563 - Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte, Angelos Stavrou:
Streaming and Unbalanced PSI from Function Secret Sharing. 564-587
Zero-Knowledge Proofs and Applications
- Alessandra Scafuro:
Black-Box Anonymous Commit-and-Prove. 591-614 - Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, Michiel Verbauwhede:
Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System. 615-638 - Hien Chu, Dario Fiore, Dimitris Kolonelos, Dominique Schröder:
Inner Product Functional Commitments with Constant-Size Public Parameters and Openings. 639-662 - Malika Izabachène, Anca Nitulescu, Paola de Perthuis, David Pointcheval:
MyOPE: Malicious SecuritY for Oblivious Polynomial Evaluation. 663-686 - Chaya Ganesh, Hamidreza Khoshakhlagh, Roberto Parisella:
NIWI and New Notions of Extraction for Algebraic Languages. 687-710 - Yusuke Sakai:
Succinct Attribute-Based Signatures for Bounded-Size Circuits by Combining Algebraic and Arithmetic Proofs. 711-734 - Chaya Ganesh, Hamidreza Khoshakhlagh, Markulf Kohlweiss, Anca Nitulescu, Michal Zajac:
What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable? 735-760 - Matteo Campanelli, Felix Engelmann, Claudio Orlandi:
Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. 761-784
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.