• 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.

found 30 matches

• 2019
• 
  Alexander Koch:
  Cryptographic Protocols from Physical Assumptions. Karlsruhe Institute of Technology, Germany, 2019
• 
  Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
  Automated Analysis of Cryptographic Assumptions in Generic Group Models. J. Cryptology 32(2): 324-360 (2019)
• 
  Guillermo Morales-Luna, Valery I. Korzhik, Vladimir Starostin, Muaed Kabardov, Aleksandr Gerasimovich, Victor Yakovlev, Aleksey Zhuvikin:
  Information theoretical secure key sharing protocol for noiseless public constant parameter channels without cryptographic assumptions. FedCSIS 2019: 327-332
• 2017
• 
  Sam Kim, David J. Wu:
  Watermarking Cryptographic Functionalities from Standard Lattice Assumptions. CRYPTO (1) 2017: 503-536
• 
  Alon Rosen, Gil Segev, Ido Shahaf:
  Can PPAD Hardness be Based on Standard Cryptographic Assumptions? TCC (2) 2017: 747-776
• 
  Sam Kim, David J. Wu:
  Watermarking Cryptographic Functionalities from Standard Lattice Assumptions. IACR Cryptology ePrint Archive 2017: 380 (2017)
• 2016
• 
  Qian Guo:
  Using Coding Techniques for Attacking Post-Quantum Cryptographic Assumptions and Systems. Lund University, Sweden, 2016
• 
  Florian Göpfert:
  Securely Instantiating Cryptographic Schemes Based on the Learning with Errors Assumption. Darmstadt University of Technology, Germany, 2016, pp. 1-129
• 
  Shafi Goldwasser, Yael Tauman Kalai:
  Cryptographic Assumptions: A Position Paper. TCC (A1) 2016: 505-522
• 
  Alon Rosen, Gil Segev, Ido Shahaf:
  Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Electronic Colloquium on Computational Complexity (ECCC) 23: 59 (2016)
• 
  Alon Rosen, Gil Segev, Ido Shahaf:
  Can PPAD Hardness be Based on Standard Cryptographic Assumptions? IACR Cryptology ePrint Archive 2016: 375 (2016)
• 2015
• 
  Shafi Goldwasser, Yael Tauman Kalai:
  Cryptographic Assumptions: A Position Paper. IACR Cryptology ePrint Archive 2015: 907 (2015)
• 2014
• 
  Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
  Automated Analysis of Cryptographic Assumptions in Generic Group Models. CRYPTO (1) 2014: 95-112
• 
  Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
  Automated Analysis of Cryptographic Assumptions in Generic Group Models. IACR Cryptology ePrint Archive 2014: 458 (2014)
• 2013
• 
  Tibor Jager, Jörg Schwenk:
  On the Analysis of Cryptographic Assumptions in the Generic Ring Model. J. Cryptology 26(2): 225-245 (2013)
• 2010
• 
  Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
  Cryptographic Complexity Classes and Computational Intractability Assumptions. ICS 2010: 266-289
• 
  Daniele Micciancio:
  Cryptographic Functions from Worst-Case Complexity Assumptions. The LLL Algorithm 2010: 427-452
• 
  Miklós Ajtai:
  Oblivious RAMs without Cryptographic Assumptions. Electronic Colloquium on Computational Complexity (ECCC) 17: 28 (2010)
• 2009
• 
  Tibor Jager, Jörg Schwenk:
  On the Analysis of Cryptographic Assumptions in the Generic Ring Model. ASIACRYPT 2009: 399-416
• 
  Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
  Cryptographic Complexity Classes and Computational Intractability Assumptions. Electronic Colloquium on Computational Complexity (ECCC) 16: 123 (2009)
• 
  Tibor Jager, Jörg Schwenk:
  On the Analysis of Cryptographic Assumptions in the Generic Ring Model. IACR Cryptology ePrint Archive 2009: 621 (2009)
• 2008
• 
  Christian Schridde, Bernd Freisleben:
  On the Validity of the phi-Hiding Assumption in Cryptographic Protocols. ASIACRYPT 2008: 344-354
• 2007
• 
  Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
  Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. PODC 2007: 310-311
• 
  Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
  Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions. DISC 2007: 7-19
• 2005
• 
  Michael Backes:
  Unifying simulatability definitions in cryptographic systems under different timing assumptions. J. Log. Algebr. Program. 64(2): 157-188 (2005)
• 2003
• 
  Michael Backes:
  Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions. CONCUR 2003: 346-360
• 
  Moni Naor:
  On Cryptographic Assumptions and Challenges. CRYPTO 2003: 96-109
• 
  Michael Backes:
  Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions. IACR Cryptology ePrint Archive 2003: 114 (2003)
• 1993
• 
  Tatsuaki Okamoto:
  On the Relationship among Cryptographic Physical Assumptions. ISAAC 1993: 369-378
• 1990
• 
  Mike Burmester:
  Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions. EUROCRYPT 1990: 1-10

found ?? matches

The Semantic Scholar full-text search requires JavaScript to operate properly. To proceed, please enable JavaScript in your browser settings.

• service temporarily not available

see all matches at semanticscholar.org