Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20. PKC 2017: Amsterdam, The Netherlands
- Serge Fehr:
Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10175, Springer 2017, ISBN 978-3-662-54387-0
Encryption with Access Control
- Nuttapong Attrapadung:
Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits. 3-35 - Fabrice Benhamouda
, Florian Bourse, Helger Lipmaa:
CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions. 36-66 - Gene Itkis, Emily Shen, Mayank Varia, David Wilson, Arkady Yerukhimovich:
Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions. 67-87 - Georg Fuchsbauer, Romain Gay, Lucas Kowalczyk, Claudio Orlandi:
Access Control Encryption for Equality, Comparison, and More. 88-118
Special Signatures
- Mihir Bellare, Bertram Poettering, Douglas Stebila:
Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures. 121-151 - Jan Camenisch, David Derler, Stephan Krenn, Henrich C. Pöhls, Kai Samelin, Daniel Slamanig:
Chameleon-Hashes with Ephemeral Trapdoors - And Applications to Invisible Sanitizable Signatures. 152-182 - Charanjit S. Jutla, Arnab Roy:
Improved Structure Preserving Signatures Under Standard Bilinear Assumptions. 183-209
Fully Homomorphic Encryption
- Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan:
Chosen-Ciphertext Secure Fully Homomorphic Encryption. 213-240 - Wutichai Chongchitmate, Rafail Ostrovsky:
Circuit-Private Multi-key FHE. 241-270 - Daniel Benarroch, Zvika Brakerski, Tancrède Lepoint:
FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime. 271-301
Real-World Schemes
- Aggelos Kiayias, Thomas Zacharias, Bingsheng Zhang:
Ceremonies for End-to-End Verifiable Elections. 305-334 - Chris Brzuska, Håkon Jacobsen:
A Modular Security Analysis of EAP and IEEE 802.11. 335-365
Multiparty Computation
- Jesper Buus Nielsen, Samuel Ranellucci:
On the Computational Overhead of MPC with Dishonest Majority. 369-395 - Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
Better Two-Round Adaptive Multi-party Computation. 396-427 - Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. 428-460
Primitives
- Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay:
Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation. 463-493 - Dan Boneh, Kevin Lewi, David J. Wu:
Constraining Pseudorandom Functions Privately. 494-524 - Venkata Koppula, Andrew Poelstra, Brent Waters:
Universal Samplers with Fast Verification. 525-554
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-04-19 19:18 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:
