A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.
Iftach HaitnerMohammad MahmoodyDavid XiaoPublished in: Computational Complexity Conference (2010)
Keyphrases
- security protocols
- cryptographic protocols
- computational complexity
- np complete
- packet filtering
- np hard
- smart card
- security properties
- homomorphic encryption
- cryptographic algorithms
- high level
- lightweight
- secure communication
- authentication protocol
- sample size
- random sampling
- network protocols
- phase transition
- network security
- sampling strategy
- monte carlo
- building blocks
- sampling methods
- privacy preserving
- digital signature
- low level
- encryption key
- sampled data
- security analysis
- information theoretic
- communication protocol
- np hardness
- lower bound
- special case
- security mechanisms
- encryption scheme
- multi party
- hash functions