default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. TCC 2015: Warsaw, Poland
- Yevgeniy Dodis, Jesper Buus Nielsen
:
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I. Lecture Notes in Computer Science 9014, Springer 2015, ISBN 978-3-662-46493-9
Foundations
- Andrej Bogdanov, Christina Brzuska:
On Basing Size-Verifiable One-Way Functions on NP-Hardness. 1-6 - Yu Yu, Dawu Gu, Xiangxue Li, Jian Weng:
The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions. 7-35 - Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen:
The Power of Negations in Cryptography. 36-65 - Kai-Min Chung, Edward Lui, Rafael Pass:
From Weak to Strong Zero-Knowledge and Applications. 66-92 - Yehuda Lindell:
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle. 93-109
Symmetric Key
- Chun Guo, Dongdai Lin:
On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation. 110-133
Multiparty Computation
- Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation. 134-158 - Tal Moran, Ilan Orlov, Silas Richelson:
Topology-Hiding Computation. 159-181 - Ben A. Fisch, Daniel Freund, Moni Naor:
Secure Physical Computation Using Disposable Circuits. 182-198 - Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. 199-228 - Vladimir Kolesnikov, Payman Mohassel, Ben Riva, Mike Rosulek:
Richer Efficiency/Security Trade-offs in 2PC. 229-259
Concurrent and Resettable Security
- Vipul Goyal, Huijia Lin, Omkant Pandey, Rafael Pass, Amit Sahai:
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma. 260-289 - Susumu Kiyoshima:
An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting. 290-318 - Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade, Tobias Nilges:
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens. 319-344 - Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam:
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way. 345-374
Non-malleable Codes and Tampering
- Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations. 375-397 - Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Leakage-Resilient Non-malleable Codes. 398-426 - Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Locally Decodable and Updatable Non-malleable Codes and Their Applications. 427-450 - Zahra Jafargholi, Daniel Wichs:
Tamper Detection and Continuous Non-malleable Codes. 451-480 - Ronald Cramer, Carles Padró, Chaoping Xing:
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. 481-501
Privacy Amplification
- Xin Li:
Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification. 502-531
Encryption and Key Exchange
- Sandro Coretti, Ueli Maurer, Björn Tackmann, Daniele Venturi:
From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes. 532-560 - Takahiro Matsuda, Goichiro Hanaoka:
Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms. 561-590 - Brett Hemenway, Rafail Ostrovsky, Alon Rosen:
Non-committing Encryption from Φ-hiding. 591-608 - Adam D. Smith, Ye Zhang:
On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption. 609-628 - Christoph Bader, Dennis Hofheinz, Tibor Jager, Eike Kiltz, Yong Li:
Tightly-Secure Authenticated Key Exchange. 629-658
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 2025-05-03 23:14 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:
