Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

multiparty cryptographic protocols

biblio

Visible to the public Mechanizing the Proof of Adaptive, Information-Theoretic Security of Cryptographic Protocols in the Random Oracle Model

Submitted by grigby1 on Wed, 01/10/2018 - 12:20pm
  • pubcrawl
  • information-theoretic security
  • Metrics
  • multiparty cryptographic protocols
  • nonprogrammable random choices
  • oracle knowledge
  • party private count retrieval protocol
  • Policy
  • Protocols
  • information theoretic security
  • random oracle model
  • real-ideal paradigm
  • Resiliency
  • Scalability
  • security of data
  • Servers
  • Upper bound
  • adaptive adversaries
  • human factor
  • Human behavior
  • honest-but-curious security
  • games approach sequence
  • Games
  • game theory
  • game parameters
  • EASYCRYPT proof assistant
  • Databases
  • Cryptography
  • Cryptographic Protocols
  • concrete upper bounds
  • composability
  • Complexity theory
  • collaboration

Terms of Use  |  ©2023. CPS-VO