Foundations of Cryptography

DOI10.1017/CBO9780511721656zbMATH Open1068.94011WikidataQ57831066 ScholiaQ57831066MaRDI QIDQ4826097FDOQ4826097

Publication date: 9 November 2004

Recommendations

scientific article; zbMATH DE number 5081837
A Classical Introduction to Cryptography
Introduction to cryptography. Principles and applications
Modern cryptography primer. Theoretical foundations and practical applications
Introduction to Modern Cryptography

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Authentication, digital signatures and secret sharing (94A62)

Cited In (only showing first 100 items - show all)

Practical Chosen Ciphertext Secure Encryption from Factoring
Foundations of Cryptography
Enhancements of trapdoor permutations
On constructing 1-1 one-way functions
On the (Im-)Possibility of Extending Coin Toss
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Concurrent knowledge extraction in public-key models
Efficient set intersection with simulation-based security
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
On \(d\)-multiplicative secret sharing
A note on constant-round zero-knowledge proofs of knowledge
Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
Program equivalence in linear contexts
Analyzing security protocols using time-bounded task-PIOAs
Randomness and computation
Automata evaluation and text search protocols with simulation-based security
Fast cut-and-choose-based protocols for malicious and covert adversaries
A proof of security of Yao's protocol for two-party computation
More on average case vs approximation complexity
Complexity theory and cryptology. An introduction to cryptocomplexity.
Efficient set operations in the presence of malicious adversaries
An efficient protocol for secure two-party computation in the presence of malicious adversaries
Communication-efficient distributed oblivious transfer
Simpler session-key generation from short random passwords
A new spin on quantum cryptography: avoiding trapdoors and embracing public keys
OT-Combiners via Secure Computation
Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
Impossibility results for universal composability in public-key models and with fixed inputs
Long-term security and universal composability
On server trust in private proxy auctions
An optimally fair coin toss
On probabilistic versus deterministic provers in the definition of proofs of knowledge
Partial fairness in secure two-party computation
Cryptography and Game Theory: Designing Protocols for Exchanging Information
Lossy trapdoor functions from homomorphic reproducible encryption
Secure two-party computation via cut-and-choose oblivious transfer
Toward a game theoretic view of secure computation
Quantum private comparison with a malicious third party
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Founding Cryptography on Tamper-Proof Hardware Tokens
On the bit security of cryptographic primitives
Bit-oriented quantum public-key encryption based on quantum perfect encryption
Cryptographic hardness of random local functions. Survey
Private Circuits II: Keeping Secrets in Tamperable Circuits
Adaptively Secure Two-Party Computation with Erasures
Cryptography with constant input locality
Timed encryption with application to deniable key exchange
Statistical Security Conditions for Two-Party Secure Function Evaluation
Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
Lower bounds for non-black-box zero knowledge
Authenticated adversarial routing
On the security of joint signature and encryption revisited
A full proof of the BGW protocol for perfectly secure multiparty computation
Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
Privacy-preserving fingerprint authentication resistant to hill-climbing attacks
On the distribution of low Hamming weight products
Super-Perfect Zero-Knowledge Proofs
Security against covert adversaries: Efficient protocols for realistic adversaries
Introduction to modern cryptography.
Three XOR-lemmas -- an exposition
Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich
Resource fairness and composability of cryptographic protocols
How to obtain full privacy in auctions
Oblivious Transfer Is Symmetric
Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
A public-key encryption scheme with pseudo-random ciphertexts
Secure multiparty computation of solid geometric problems and their applications
General composition and universal composability in secure multiparty computation
Symmetric cryptographic protocols for extended millionaires' problem
Constant-round adaptive zero-knowledge proofs for NP
Secure computation without computers
Secure computation without authentication
Anonymous Quantum Communication
Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
Knowledge encryption and its applications to simulatable protocols with low round-complexity
Weak zero-knowledge via the Goldreich-Levin theorem
On the power of an honest majority in three-party computation without broadcast
OptORAMa: Optimal oblivious RAM
Beyond honest majority: the round complexity of fair and robust multi-party computation
Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols
Three party secure computation with friends and foes
Composable long-term security with rewinding
Pseudorandomness with proof of destruction and applications
Private join and compute from PIR with default
Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
Compact NIZKs from standard assumptions on bilinear maps
Actively secure half-gates with minimum overhead under duplex networks
Completeness theorems for adaptively secure broadcast
Private computations on set intersection
Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
Complete characterization of fairness in secure two-party computation of Boolean functions
Fast secure two-party ECDSA signing
Topology-hiding computation on all graphs
Locality-preserving oblivious RAM
Constant-round simulation-secure coin tossing extension with guaranteed output
Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
On perfectly secure two-party computation for symmetric functionalities with correlated randomness

This page was built for publication: Foundations of Cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4826097)