The proceedings version of this paper appears in ACM CCSThis is the full version of that paper. Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗

Source URL: web.cs.ucdavis.edu

• Cryptography
• Secret sharing
• Public-key cryptography
• Proactive secret sharing
• Commitment scheme
• Ciphertext indistinguishability
• Adversary model
• Digital signature
• Encryption
• Information-theoretic security

Electronic Colloquium on Computational Complexity, Report NoBounded Indistinguishability and the Complexity of Recovering Secrets Andrej Bogdanov∗

Source URL: www.ccs.neu.edu

Computational Indistinguishability Logics Bruce M. Kapron Computer Science Department University of Victoria June 27, 2009

Source URL: www-mitacs2009.imag.fr

Inductive Proof Method for Computational Secrecy Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell Department of Computer Science, Stanford University Abstract. We investigate inductive methods for proving secrecy p

Source URL: seclab.stanford.edu

• Cryptography
• Authentication protocols
• Computer network security
• Ciphertext indistinguishability
• DolevYao model
• Advantage
• Kerberos
• Cryptographic protocol
• Security parameter
• XTR
• Challengeresponse authentication
• Security protocol notation

Efficient Secure Two-Party Protocols: Techniques and Constructions

Source URL: www.eng.biu.ac.il

• Secure two-party computation
• Zero-knowledge proof
• Commitment scheme
• Oblivious transfer
• Computational indistinguishability
• Oded Goldreich
• Ciphertext indistinguishability
• Man-in-the-middle attack
• Cryptography
• Cryptographic protocols
• Secure multi-party computation

Proving Computational Security with a General-Purpose C Verifier A 5-Minute Talk Fran¸cois Dupressoir The Open University

Source URL: csf2012.seas.harvard.edu

• Computational hardness assumption
• Ciphertext indistinguishability
• Computer security
• Cyberwarfare
• Science
• Cryptography
• Cryptographic primitive
• Information-theoretic security

Computational Indistinguishability Amplification: Tight Product Theorems for System Composition Ueli Maurer Stefano Tessaro

Source URL: www.iacr.org

Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE

Source URL: certicrypt.gforge.inria.fr

• ElGamal encryption
• Public-key cryptography
• Ciphertext indistinguishability
• Diffie–Hellman problem
• Decisional Diffie–Hellman assumption
• Optimal asymmetric encryption padding
• Cramer–Shoup cryptosystem
• Cryptography
• Computational hardness assumptions
• Finite fields

On the Impossibility of Tight Cryptographic Reductions Christoph Bader, Tibor Jager, Yong Li, and Sven Sch¨age Horst G¨ortz Institute for IT Security, Ruhr-University Bochum, Germany {christoph.bader, tibor.jager, yong

Source URL: eprint.iacr.org

• Public-key cryptography
• Digital signature
• Key management
• Notary
• Ciphertext indistinguishability
• Computational complexity theory
• Reduction
• Security parameter
• RSA
• Cryptography
• Theoretical computer science
• Applied mathematics

Inductive Proofs of Computational Secrecy ? Arnab Roy1 , Anupam Datta2 , Ante Derek1 , John C. Mitchell1 1

Source URL: theory.stanford.edu

• Needham–Schroeder protocol
• Ciphertext indistinguishability
• Kerberos
• Advantage
• XTR
• Ticket Granting Ticket
• Cryptography
• Cryptographic protocols
• Computer network security