Foundations of Cryptography
From MaRDI portal
Publication:4328696
DOI10.1017/CBO9780511546891zbMath1007.94016OpenAlexW1548880861WikidataQ57831070 ScholiaQ57831070MaRDI QIDQ4328696
Publication date: 29 April 2002
Full work available at URL: https://doi.org/10.1017/cbo9780511546891
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items
A New Pseudorandom Generator from Collision-Resistant Hash Functions, A compressed \(\varSigma \)-protocol theory for lattices, Complete Problem for Perfect Zero-Knowledge Quantum Proof, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Constant-round leakage-resilient zero-knowledge from collision resistance, Towards a unified approach to black-box constructions of zero-knowledge proofs, Honest majority MPC with abort with minimal online communication, Modular approach to the design and analysis of password-based security protocols, Universally composable anonymous hash certification model, Improved zero-knowledge argument of encrypted extended permutation, Simpler constructions of asymmetric primitives from obfuscation, Hardness assumptions in the foundations of theoretical computer science, Pseudo-free families and cryptographic primitives, Discrete logarithms for finite groups, Enhancements of trapdoor permutations, Polynomial runtime and composability, On the algebraic immunity of direct sum constructions, Secure multi-party computation in large networks, Single-server private information retrieval with sublinear amortized time, Toward non-interactive zero-knowledge proofs for NP from LWE, Fully homomorphic NIZK and NIWI proofs, Locally computable UOWHF with linear shrinkage, Semi-quantum money, On constructing one-way permutations from indistinguishability obfuscation, Gambling, Computational Information and Encryption Security, On Equivalences, Metrics, and Polynomial Time, Block encryption of quantum messages, Towards Proofs of Ownership Beyond Bounded Leakage, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, Lower bounds and impossibility results for concurrent self composition, A framework for real-valued cipher systems, Existence of 3-round zero-knowledge proof systems for NP, In search of mathematical primitives for deriving universal projective hash families, Universally composable symbolic security analysis, Individual simulations, Security limitations of classical-client delegated quantum computing, Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness, Direct product hardness amplification, \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds, A new interactive hashing theorem, Concurrent zero knowledge, revisited, Quantum dice rolling: a multi-outcome generalization of quantum coin flipping, Cryptographic reverse firewalls for interactive proof systems, On Resource-Bounded Versions of the van Lambalgen Theorem, Two methods for privacy preserving data mining with malicious participants, Gate Elimination for Linear Functions and New Feebly Secure Constructions, Analyzing Standards for RSA Integers, Proving SAT does not have small circuits with an application to the two queries problem, Fast S-box security mechanism research based on the polymorphic cipher, Bounds on the sample complexity for private learning and private data release, Novel \(\Omega\)-protocols for NP, Algorithmic rationality: game theory with costly computation, Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs, Sound and complete computational interpretation of symbolic hashes in the standard model, Contract signing, optimism, and advantage, Lower bounds for non-black-box zero knowledge, Non-ambiguity of blind watermarking: a revisit with analytical resolution, On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits, Bounds on the efficiency of black-box commitment schemes, Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles, The computational SLR: a logic for reasoning about computational indistinguishability, On the relationship between statistical zero-knowledge and statistical randomized encodings, Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources, Cryptographic Assumptions: A Position Paper, Simplified Universal Composability Framework, Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits, On Constructing One-Way Permutations from Indistinguishability Obfuscation, Pseudorandom generators from regular one-way functions: new constructions with improved parameters, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, On the complexity of constructing pseudorandom functions (especially when they don't exist), How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge, Protocols for multiparty coin toss with a dishonest majority, On the power of secure two-party computation, On Constructing 1-1 One-Way Functions, Strong Proofs of Knowledge, On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge, A Candidate Counterexample to the Easy Cylinders Conjecture, From Absolute Distinguishability to Positive Distinguishability, In a World of P=BPP, Notes on Levin’s Theory of Average-Case Complexity, Three XOR-Lemmas — An Exposition, On Yao’s XOR-Lemma, Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art, Average Case Complexity, Revisited, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, High-Precision Secure Computation of Satellite Collision Probabilities, On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs, Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly, Network-Hiding Communication and Applications to Multi-party Protocols, Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption, On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings, A non linear transform of Riesz product and an application in cryptography, On black-box complexity of universally composable security in the CRS model, The magic of ELFs, Universal test for quantum one-way permutations, Formal security proofs with minimal fuss: implicit computational complexity at work, From non-adaptive to adaptive pseudorandom functions, An efficient protocol for secure two-party computation in the presence of malicious adversaries, Program equivalence in linear contexts, Cryptography and algorithmic randomness, On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \), A black-box approach to post-quantum zero-knowledge in constant rounds, Concurrent knowledge extraction in public-key models, Algebra of polynomially bounded sequences and negligible functions, Differentially private data publishing for arbitrarily partitioned data, Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery, Automata evaluation and text search protocols with simulation-based security, Round-optimal fully black-box zero-knowledge arguments from one-way permutations, Counting and sampling \(H\)-colourings, Fine-grained secure computation, The security of lazy users in out-of-band authentication, Quantum algorithms for the \(k\)-XOR problem, Time hierarchies for cryptographic function inversion with advice, Fiat-Shamir for highly sound protocols is instantiable, A note on the Dwork-Naor timed deniable authentication, On the bit security of cryptographic primitives, A counterexample to the chain rule for conditional HILL entropy, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Cryptographic hardness of random local functions. Survey, Local expanders, A provably secure non-iterative hash function resisting birthday attack, Zero-knowledge proofs of retrievability, Paillier's trapdoor function hides \(\Theta(n)\) bits, Full and partial deniability for authentication schemes, Privacy-preserving algorithms for distributed mining of frequent itemsets, Improved hardness amplification in NP, Round-optimal zero-knowledge proofs of knowledge for NP, A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module, A note on constant-round zero-knowledge proofs of knowledge, Improved quantum signature scheme with weak arbitrator, Monoidal computer. I: Basic computability by string diagrams, Statistical zero knowledge and quantum one-way functions, On optimal cryptographic key derivation, On using probabilistic Turing machines to model participants in cryptographic protocols, Quantum signature scheme with weak arbitrator, Precise zero-knowledge arguments with poly-logarithmic efficiency, Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP, Improving classical authentication over a quantum channel, A pure labeled transition semantics for the applied pi calculus, Pseudorandom generators against advised context-free languages, A public key cryptosystem based on three new provable problems, On constant-round concurrent non-malleable proof systems, The hunting of the SNARK, Constant-round adaptive zero-knowledge proofs for NP, Quantum public-key cryptosystem, One-way functions using algorithmic and classical information theories, Public-coin parallel zero-knowledge for NP, Feebly secure cryptographic primitives, Circuit complexity of linear functions: gate elimination and feeble security, Quantum identity authentication with single photon, Multi-verifier signatures, Efficient set operations in the presence of malicious adversaries, Concurrent non-malleable statistically hiding commitment, Authentication schemes from actions on graphs, groups, or rings, Efficient construction of provably secure steganography under ordinary covert channels, Simple and more efficient PRFs with tight security from LWE and matrix-DDH, Possibility and impossibility results for selective decommitments, Short undeniable signatures based on group homomorphisms, Immunity and pseudorandomness of context-free languages, SZK proofs for black-box group problems, Several cryptographic applications of \(\Sigma\)-protocol, Public-key cryptography based on bounded quantum reference frames, A note on Yao's theorem about pseudo-random generators, Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions, A framework for non-interactive instance-dependent commitment schemes (NIC), When can limited randomness be used in repeated games?, Minimizing locality of one-way functions via semi-private randomized encodings, Efficient one-sided adaptively secure computation, Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography, On a mnemonic construction of permutations, A new framework for the design and analysis of identity-based identification schemes, Everlasting multi-party computation, On the (im-)possibility of extending coin toss, Pseudo-free families of finite computational elementary abelian \(p\)-groups, Oracle separations between quantum and non-interactive zero-knowledge classes, Turing machines, transition systems, and interaction, New number-theoretic cryptographic primitives, Toward an algebraic theory of systems, Secure pseudorandom bit generators and point sets with low star-discrepancy, Pseudo-free families of computational universal algebras, \(k\)-anonymous data collection, QUAD: A multivariate stream cipher with provable security, On complete one-way functions, A note on universal composable zero-knowledge in the common reference string model, Semantic security for the McEliece cryptosystem without random oracles, On linear-size pseudorandom generators and hardcore functions, Key-dependent message security: generic amplification and completeness, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, Analyzing security protocols using time-bounded task-PIOAs, Handling expected polynomial-time strategies in simulation-based security proofs, New binding-concealing trade-offs for quantum string commitment, Cryptographic pseudorandom generators can make cryptosystems problematic, Reducing complexity assumptions for statistically-hiding commitment, Cryptography with constant input locality, The twin Diffie-Hellman problem and applications, Variations on a theme by Akl and Taylor: security and tradeoffs, A new identity-based multivariate signature scheme, Universal construction of a full quantum one-way function, New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust, Formalizing data deletion in the context of the right to be forgotten, Proving knowledge of isogenies: a survey, An identification system based on the explicit isomorphism problem, Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error, Decentralized nonconvex optimization with guaranteed privacy and accuracy, A random oracle for all of us, Achievable \textsf{CCA2} relaxation for homomorphic encryption, Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head, General properties of quantum bit commitments (extended abstract), Concurrently composable non-interactive secure computation, Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\), Paradigms for Unconditional Pseudorandom Generators, Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs, Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP, Bit security as computational cost for winning games with high probability, A new approach to efficient non-malleable zero-knowledge, Bet-or-pass: adversarially robust Bloom filters, Streaming functional encryption, Beyond honest majority: the round complexity of fair and robust multi-party computation, One-Way Functions and (Im)perfect Obfuscation, Format-preserving encryption: a survey, On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation, Unconditionally-Secure and Reusable Public-Key Authentication, Compact Lossy and All-but-One Trapdoor Functions from Lattice, Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol, Efficient Secure Multiparty Computation with Identifiable Abort, (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond, Bloom Filters in Adversarial Environments, Towards Non-Black-Box Separations of Public Key Encryption and One Way Function, Zero-Knowledge Interactive Proof Systems for New Lattice Problems, A New Non-Merkle-Damgård Structural Hash Function with Provable Security, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Super-Perfect Zero-Knowledge Proofs, ON THE CIRCUIT-SIZE OF INVERSES, Keyed Streebog is a secure PRF and MAC, An Infinitely-Often One-Way Function Based on an Average-Case Assumption, Unnamed Item, Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks, Unnamed Item, Cryptography and cryptographic protocols, Zero-Knowledge Proofs of Proximity, Practical Order-Revealing Encryption with Limited Leakage, О криптографических свойствах алгоритмов, сопутствующих применению стандартов ГОСТ Р 34.11-2012 и ГОСТ Р 34.10-2012, Efficient Error-Correcting Codes for Sliding Windows, Cryptography Using Captcha Puzzles, The Knowledge Complexity of Interactive Proof Systems, On the complexity of compressing obfuscation, RECOGNIZING STRONG RANDOM REALS, Brute force attacks on hash functions, Predictable Arguments of Knowledge, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Magic Adversaries Versus Individual Reduction: Science Wins Either Way, Infinitely generated semigroups and polynomial complexity, An infinitely-often one-way function based on an average-case assumption, Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks, A Calculus for Game-Based Security Proofs, QUAD: A Practical Stream Cipher with Provable Security, The truth behind the myth of the folk theorem, Unlinkable Randomizable Signature and Its Application in Group Signature, Limits of Constructive Security Proofs, Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Basing Weak Public-Key Cryptography on Strong One-Way Functions, How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge, General Properties of Quantum Zero-Knowledge Proofs, Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries, Semi-honest to Malicious Oblivious Transfer—The Black-Box Way, A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval, On the exact round complexity of secure three-party computation, Round-optimal secure multi-party computation, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, Can PPAD hardness be based on standard cryptographic assumptions?, A note on the feasibility of generalised universal composability, Constructing tree decompositions of graphs with bounded gonality, The Twin Diffie-Hellman Problem and Applications, Fine-grained cryptography revisited, The Complexity of Zero Knowledge, Multiparty generation of an RSA modulus, Communication-Efficient Private Protocols for Longest Common Subsequence, Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening, Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening, Comparative Analysis of Random Generators, Randomness and Computation, On Security Preserving Reductions – Revised Terminology, Another Motivation for Reducing the Randomness Complexity of Algorithms, The Computational SLR: A Logic for Reasoning about Computational Indistinguishability, Precise Time and Space Simulatable Zero-Knowledge, Weak Oblivious Transfer from Strong One-Way Functions, Generalized Learning Problems and Applications to Non-commutative Cryptography, A Novel Framework for Protocol Analysis, Universally Composable Adaptive Priced Oblivious Transfer, Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model, A Feebly Secure Trapdoor Function, ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD NP ∩ coNP FUNCTION, Coded Circuit for Trusted Computing: Towards Dynamic Integrity Measurement, A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys, How to Use Indistinguishability Obfuscation: Deniable Encryption, and More, Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security, Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model, Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge, Efficiency Limitations for Σ-Protocols for Group Homomorphisms, Composition of Zero-Knowledge Proofs with Efficient Provers, Private Coins versus Public Coins in Zero-Knowledge Proof Systems, Semigroups and one-way functions, Constant-Round Nonmalleable Commitments from Any One-Way Function, Unnamed Item, Unnamed Item, Interactive Hashing: An Information Theoretic Tool (Invited Talk), Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, Multiparty generation of an RSA modulus, Privacy-Preserving Queries on Encrypted Data, The Complexity of Public-Key Cryptography, Pseudorandom Functions: Three Decades Later, How to Simulate It – A Tutorial on the Simulation Proof Technique, Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer, Computational Probabilistic Non-interference
