Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2013
- Shweta Agrawal, Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption: New Perspectives and Lower Bounds. CRYPTO (2) 2013: 500-518 - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters:
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys. CRYPTO (2) 2013: 166-184 - Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi:
Instantiating Random Oracles via UCEs. CRYPTO (2) 2013: 398-415 - Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza:
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. CRYPTO (2) 2013: 90-108 - Dan Boneh, Ananth Raghunathan, Gil Segev:
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption. CRYPTO (2) 2013: 461-478 - Dan Boneh, Mark Zhandry:
Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World. CRYPTO (2) 2013: 361-379 - Zvika Brakerski, Guy N. Rothblum:
Obfuscating Conjunctions. CRYPTO (2) 2013: 416-434 - Anne Broadbent, Gus Gutoski, Douglas Stebila:
Quantum One-Time Programs - (Extended Abstract). CRYPTO (2) 2013: 344-360 - Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O'Neill, Omer Paneth, Giuseppe Persiano:
On the Achievability of Simulation-Based Security for Functional Encryption. CRYPTO (2) 2013: 519-535 - Jie Chen, Hoeteck Wee:
Fully, (Almost) Tightly Secure IBE and Dual System Groups. CRYPTO (2) 2013: 435-460 - Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum:
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). CRYPTO (2) 2013: 185-202 - Frédéric Dupuis, Omar Fawzi, Stephanie Wehner:
Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling. CRYPTO (2) 2013: 326-343 - Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Non-malleable Codes from Two-Source Extractors. CRYPTO (2) 2013: 239-257 - Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, Jorge L. Villar:
An Algebraic Framework for Diffie-Hellman Assumptions. CRYPTO (2) 2013: 129-147 - Nelly Fazio, Rosario Gennaro, Irippuge Milinda Perera, William E. Skeith III:
Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields. CRYPTO (2) 2013: 148-165 - Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. CRYPTO (2) 2013: 258-276 - Sanjam Garg, Craig Gentry, Shai Halevi, Amit Sahai, Brent Waters:
Attribute-Based Encryption for Circuits from Multilinear Maps. CRYPTO (2) 2013: 479-499 - Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich:
How to Run Turing Machines on Encrypted Data. CRYPTO (2) 2013: 536-553 - Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and. CRYPTO (2) 2013: 109-128 - Vipul Goyal, Divya Gupta, Abhishek Jain:
What Information Is Leaked under Concurrent Composition? CRYPTO (2) 2013: 220-238 - Martin Hirt, Christoph Lucas, Ueli Maurer:
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. CRYPTO (2) 2013: 203-219 - Martin Hirt, Christoph Lucas, Ueli Maurer:
Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. CRYPTO (2) 2013 - Yan Huang, Jonathan Katz, David Evans:
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. CRYPTO (2) 2013: 18-35 - Vladimir Kolesnikov, Ranjit Kumaresan:
Improved OT Extension for Transferring Short Secrets. CRYPTO (2) 2013: 54-70 - Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Linearly Homomorphic Structure-Preserving Signatures and Their Applications. CRYPTO (2) 2013: 289-307 - Yehuda Lindell:
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. CRYPTO (2) 2013: 1-17 - Vadim Lyubashevsky, Daniel Masny:
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. CRYPTO (2) 2013: 308-325 - Payman Mohassel, Ben Riva:
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation. CRYPTO (2) 2013: 36-53 - Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities and Information Inequalities. CRYPTO (2) 2013: 277-288 - Justin Thaler:
Time-Optimal Interactive Proofs for Circuit Evaluation. CRYPTO (2) 2013: 71-89
skipping 2 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-30 20:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint